Base | Representation |
---|---|
bin | 1010111011101110100101… |
… | …0010000001101011100011 |
3 | 1120120012220100102020221202 |
4 | 2232323221102001223203 |
5 | 3033423440432423021 |
6 | 41322251120111415 |
7 | 2350335225456620 |
oct | 256735122015343 |
9 | 46505810366852 |
10 | 12021232311011 |
11 | 39151a3279380 |
12 | 142196646556b |
13 | 69279c492821 |
14 | 2d7b8b805347 |
15 | 15ca76e5aa0b |
hex | aeee9481ae3 |
12021232311011 has 16 divisors (see below), whose sum is σ = 15198602116608. Its totient is φ = 9235261694400.
The previous prime is 12021232311001. The next prime is 12021232311061. The reversal of 12021232311011 is 11011323212021.
It is not a de Polignac number, because 12021232311011 - 222 = 12021228116707 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12021232311001) 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 15 ways as a sum of consecutive naturals, for example, 1099430450 + ... + 1099441383.
It is an arithmetic number, because the mean of its divisors is an integer number (949912632288).
Almost surely, 212021232311011 is an apocalyptic number.
12021232311011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12021232311011 is a deficient number, since it is larger than the sum of its proper divisors (3177369805597).
12021232311011 is a wasteful number, since it uses less digits than its factorization.
12021232311011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2198871922.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 12021232311011 its reverse (11011323212021), we get a palindrome (23032555523032).
The spelling of 12021232311011 in words is "twelve trillion, twenty-one billion, two hundred thirty-two million, three hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •