Base | Representation |
---|---|
bin | 10110111100101010… |
… | …01100100011110011 |
3 | 1011210121022112002221 |
4 | 23132111030203303 |
5 | 200212412024021 |
6 | 5354301021511 |
7 | 614205360406 |
oct | 133625144363 |
9 | 34717275087 |
10 | 12320033011 |
11 | 5252379170 |
12 | 2479b54897 |
13 | 1214557a80 |
14 | 84c327d3d |
15 | 4c18da241 |
hex | 2de54c8f3 |
12320033011 has 8 divisors (see below), whose sum is σ = 14473885104. Its totient is φ = 10338489120.
The previous prime is 12320033003. The next prime is 12320033017. The reversal of 12320033011 is 11033002321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12320033011 - 23 = 12320033003 is a prime.
It is a super-2 number, since 2×123200330112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12320033017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43076896 + ... + 43077181.
It is an arithmetic number, because the mean of its divisors is an integer number (1809235638).
Almost surely, 212320033011 is an apocalyptic number.
12320033011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12320033011 is a deficient number, since it is larger than the sum of its proper divisors (2153852093).
12320033011 is a wasteful number, since it uses less digits than its factorization.
12320033011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86154101.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 12320033011 its reverse (11033002321), we get a palindrome (23353035332).
The spelling of 12320033011 in words is "twelve billion, three hundred twenty million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •