Base | Representation |
---|---|
bin | 1010111011000100101111… |
… | …0010100101010110100011 |
3 | 1120112010220120001101012100 |
4 | 2232301023302211112203 |
5 | 3033232440012023021 |
6 | 41313152355101443 |
7 | 2346456666366060 |
oct | 256611362452643 |
9 | 46463816041170 |
10 | 12010000111011 |
11 | 3910459a65261 |
12 | 141b7508a1883 |
13 | 6916cc418736 |
14 | 2d7403b6dc67 |
15 | 15c61ad01626 |
hex | aec4bca55a3 |
12010000111011 has 96 divisors (see below), whose sum is σ = 20206698670080. Its totient is φ = 6732144115200.
The previous prime is 12010000110961. The next prime is 12010000111049. The reversal of 12010000111011 is 11011100001021.
It is not a de Polignac number, because 12010000111011 - 227 = 12009865893283 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 12010000110984 and 12010000111002.
It is not an unprimeable number, because it can be changed into a prime (12010008111011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 791530021 + ... + 791545193.
It is an arithmetic number, because the mean of its divisors is an integer number (210486444480).
Almost surely, 212010000111011 is an apocalyptic number.
12010000111011 is a deficient number, since it is larger than the sum of its proper divisors (8196698559069).
12010000111011 is a wasteful number, since it uses less digits than its factorization.
12010000111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16137 (or 16134 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 12010000111011 its reverse (11011100001021), we get a palindrome (23021100112032).
The spelling of 12010000111011 in words is "twelve trillion, ten billion, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •