Base | Representation |
---|---|
bin | 1010111011001001010000… |
… | …0001100111001010001001 |
3 | 1120112021001000110020020120 |
4 | 2232302110001213022021 |
5 | 3033242430233310441 |
6 | 41313512530213453 |
7 | 2346532013353452 |
oct | 256622401471211 |
9 | 46467030406216 |
10 | 12011212010121 |
11 | 3910a21058a75 |
12 | 141ba2a724289 |
13 | 691863517cbc |
14 | 2d74baaba129 |
15 | 15c68c3dc966 |
hex | aec94067289 |
12011212010121 has 16 divisors (see below), whose sum is σ = 16356006130944. Its totient is φ = 7836952806144.
The previous prime is 12011212010117. The next prime is 12011212010183. The reversal of 12011212010121 is 12101021211021.
It is a happy number.
It is not a de Polignac number, because 12011212010121 - 22 = 12011212010117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12011212010121.
It is not an unprimeable number, because it can be changed into a prime (12011212010101) 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 15 ways as a sum of consecutive naturals, for example, 6827265 + ... + 8404401.
It is an arithmetic number, because the mean of its divisors is an integer number (1022250383184).
Almost surely, 212011212010121 is an apocalyptic number.
It is an amenable number.
12011212010121 is a deficient number, since it is larger than the sum of its proper divisors (4344794120823).
12011212010121 is a wasteful number, since it uses less digits than its factorization.
12011212010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1631200.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12011212010121 its reverse (12101021211021), we get a palindrome (24112233221142).
The spelling of 12011212010121 in words is "twelve trillion, eleven billion, two hundred twelve million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •