Base | Representation |
---|---|
bin | 111010011000100101101… |
… | …001111010110000001011 |
3 | 112012120000022200111212021 |
4 | 322120211221322300023 |
5 | 1011213321041400021 |
6 | 12311051515425311 |
7 | 562603231336144 |
oct | 72304551726013 |
9 | 15176008614767 |
10 | 4012131200011 |
11 | 1307598514800 |
12 | 5496b2755237 |
13 | 23145b1a8cac |
14 | dc28c550acb |
15 | 6e570ee4c41 |
hex | 3a625a7ac0b |
4012131200011 has 48 divisors (see below), whose sum is σ = 4745690933760. Its totient is φ = 3381362230400.
The previous prime is 4012131199961. The next prime is 4012131200039. The reversal of 4012131200011 is 1100021312104.
4012131200011 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4012131200011 - 225 = 4012097645579 is a prime.
It is a super-2 number, since 2×40121312000112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4012131200111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11485911 + ... + 11830063.
It is an arithmetic number, because the mean of its divisors is an integer number (98868561120).
Almost surely, 24012131200011 is an apocalyptic number.
4012131200011 is a deficient number, since it is larger than the sum of its proper divisors (733559733749).
4012131200011 is a wasteful number, since it uses less digits than its factorization.
4012131200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344328 (or 344317 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 4012131200011 its reverse (1100021312104), we get a palindrome (5112152512115).
The spelling of 4012131200011 in words is "four trillion, twelve billion, one hundred thirty-one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •