Base | Representation |
---|---|
bin | 10110010110110000… |
… | …00000000001110011 |
3 | 1010222102212211012222 |
4 | 23023120000001303 |
5 | 144040003013021 |
6 | 5302540311255 |
7 | 603264216410 |
oct | 131330000163 |
9 | 33872784188 |
10 | 12002001011 |
11 | 50a98a9000 |
12 | 23ab54252b |
13 | 11936b5560 |
14 | 81bdbd107 |
15 | 4a3a186ab |
hex | 2cb600073 |
12002001011 has 64 divisors (see below), whose sum is σ = 16362694656. Its totient is φ = 8571911040.
The previous prime is 12002001007. The next prime is 12002001017. The reversal of 12002001011 is 11010020021.
It is not a de Polignac number, because 12002001011 - 22 = 12002001007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12002001011.
It is not an unprimeable number, because it can be changed into a prime (12002001017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 23860586 + ... + 23861088.
It is an arithmetic number, because the mean of its divisors is an integer number (255667104).
Almost surely, 212002001011 is an apocalyptic number.
12002001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12002001011 is a deficient number, since it is larger than the sum of its proper divisors (4360693645).
12002001011 is a wasteful number, since it uses less digits than its factorization.
12002001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 753 (or 731 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 12002001011 its reverse (11010020021), we get a palindrome (23012021032).
It can be divided in two parts, 120020010 and 11, that added together give a palindrome (120020021).
The spelling of 12002001011 in words is "twelve billion, two million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •