Base | Representation |
---|---|
bin | 1011000111010111010001… |
… | …0011100001011110001011 |
3 | 1121021022212210021012121120 |
4 | 2301311310103201132023 |
5 | 3100212340101411021 |
6 | 41554151110410323 |
7 | 2400643034325564 |
oct | 261656423413613 |
9 | 47238783235546 |
10 | 12221133232011 |
11 | 3991a54118000 |
12 | 14546549609a3 |
13 | 6a85a9101472 |
14 | 30371269516b |
15 | 162d7685d2c6 |
hex | b1d744e178b |
12221133232011 has 64 divisors (see below), whose sum is σ = 18043483307520. Its totient is φ = 7357054003200.
The previous prime is 12221133232001. The next prime is 12221133232037. The reversal of 12221133232011 is 11023233112221.
It is not a de Polignac number, because 12221133232011 - 26 = 12221133231947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12221133232001) 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 63 ways as a sum of consecutive naturals, for example, 1406501955 + ... + 1406510643.
It is an arithmetic number, because the mean of its divisors is an integer number (281929426680).
Almost surely, 212221133232011 is an apocalyptic number.
12221133232011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12221133232011 is a deficient number, since it is larger than the sum of its proper divisors (5822350075509).
12221133232011 is a wasteful number, since it uses less digits than its factorization.
12221133232011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11049 (or 11027 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 12221133232011 its reverse (11023233112221), we get a palindrome (23244366344232).
The spelling of 12221133232011 in words is "twelve trillion, two hundred twenty-one billion, one hundred thirty-three million, two hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •