Base | Representation |
---|---|
bin | 110101001001011010… |
… | …0001011010101000011 |
3 | 101220121002001121211211 |
4 | 1222102310023111003 |
5 | 3332220332113443 |
6 | 124233123150551 |
7 | 11150206360411 |
oct | 1522264132503 |
9 | 356532047754 |
10 | 114132301123 |
11 | 44448788105 |
12 | 1a152815457 |
13 | a9bb6615b9 |
14 | 5749d362b1 |
15 | 2e7eca319d |
hex | 1a92d0b543 |
114132301123 has 16 divisors (see below), whose sum is σ = 126898816000. Its totient is φ = 102203972640.
The previous prime is 114132301111. The next prime is 114132301163. The reversal of 114132301123 is 321103231411.
It is a cyclic number.
It is not a de Polignac number, because 114132301123 - 217 = 114132170051 is a prime.
It is a super-2 number, since 2×1141323011232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114132301094 and 114132301103.
It is not an unprimeable number, because it can be changed into a prime (114132301163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2227848 + ... + 2278501.
It is an arithmetic number, because the mean of its divisors is an integer number (7931176000).
Almost surely, 2114132301123 is an apocalyptic number.
114132301123 is a deficient number, since it is larger than the sum of its proper divisors (12766514877).
114132301123 is a wasteful number, since it uses less digits than its factorization.
114132301123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4506442.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 114132301123 its reverse (321103231411), we get a palindrome (435235532534).
The spelling of 114132301123 in words is "one hundred fourteen billion, one hundred thirty-two million, three hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •