Base | Representation |
---|---|
bin | 1010111011001100101000… |
… | …1101100110001000011111 |
3 | 1120112100101101002212100101 |
4 | 2232303022031212020133 |
5 | 3033301311001340221 |
6 | 41314143043441531 |
7 | 2346563362600423 |
oct | 256631215461037 |
9 | 46470341085311 |
10 | 12012121121311 |
11 | 3911348243733 |
12 | 14200430862a7 |
13 | 69197998180c |
14 | 2d7565728b83 |
15 | 15c6e2118d91 |
hex | aecca36621f |
12012121121311 has 8 divisors (see below), whose sum is σ = 12024732714624. Its totient is φ = 11999510025240.
The previous prime is 12012121121293. The next prime is 12012121121339. The reversal of 12012121121311 is 11312112121021.
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 12012121121311 - 25 = 12012121121279 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012121121381) 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 7 ways as a sum of consecutive naturals, for example, 67301190 + ... + 67479436.
It is an arithmetic number, because the mean of its divisors is an integer number (1503091589328).
Almost surely, 212012121121311 is an apocalyptic number.
12012121121311 is a deficient number, since it is larger than the sum of its proper divisors (12611593313).
12012121121311 is an equidigital number, since it uses as much as digits as its factorization.
12012121121311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248621.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 12012121121311 its reverse (11312112121021), we get a palindrome (23324233242332).
The spelling of 12012121121311 in words is "twelve trillion, twelve billion, one hundred twenty-one million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •