Base | Representation |
---|---|
bin | 1101101010110… |
… | …01011110001101 |
3 | 21222202101200101 |
4 | 12311121132031 |
5 | 213323130021 |
6 | 15213331101 |
7 | 2561414251 |
oct | 665313615 |
9 | 258671611 |
10 | 114661261 |
11 | 597a5780 |
12 | 32496a91 |
13 | 1a9a7c00 |
14 | 1132a261 |
15 | a0eda91 |
hex | 6d5978d |
114661261 has 24 divisors (see below), whose sum is σ = 139191264. Its totient is φ = 93562560.
The previous prime is 114661229. The next prime is 114661291. The reversal of 114661261 is 162166411.
It is not a de Polignac number, because 114661261 - 25 = 114661229 is a prime.
It is a super-2 number, since 2×1146612612 = 26294409548220242, which contains 22 as substring.
It is a Duffinian number.
Its product of digits (1728) is a multiple of the sum of its prime divisors (1728).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114661201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67950 + ... + 69616.
It is an arithmetic number, because the mean of its divisors is an integer number (5799636).
Almost surely, 2114661261 is an apocalyptic number.
114661261 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
114661261 is a deficient number, since it is larger than the sum of its proper divisors (24530003).
114661261 is a wasteful number, since it uses less digits than its factorization.
114661261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1741 (or 1728 counting only the distinct ones).
The product of its digits is 1728, while the sum is 28.
The square root of 114661261 is about 10707.9998599178. Note that the first 3 decimals coincide. The cubic root of 114661261 is about 485.8164743099.
The spelling of 114661261 in words is "one hundred fourteen million, six hundred sixty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •