Base | Representation |
---|---|
bin | 1010111011000101001100… |
… | …0000001111010001011111 |
3 | 1120112011012222202211112222 |
4 | 2232301103000033101133 |
5 | 3033233212002143403 |
6 | 41313212401015555 |
7 | 2346462666136244 |
oct | 256612300172137 |
9 | 46464188684488 |
10 | 12010121131103 |
11 | 3910511303467 |
12 | 141b7853245bb |
13 | 69171b50ba64 |
14 | 2d7415c735cb |
15 | 15c626759338 |
hex | aec5300f45f |
12010121131103 has 2 divisors, whose sum is σ = 12010121131104. Its totient is φ = 12010121131102.
The previous prime is 12010121131009. The next prime is 12010121131123. The reversal of 12010121131103 is 30113112101021.
12010121131103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12010121131103 - 242 = 7612074619999 is a prime.
It is a super-2 number, since 2×120101211311032 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12010121131123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005060565551 + 6005060565552.
It is an arithmetic number, because the mean of its divisors is an integer number (6005060565552).
Almost surely, 212010121131103 is an apocalyptic number.
12010121131103 is a deficient number, since it is larger than the sum of its proper divisors (1).
12010121131103 is an equidigital number, since it uses as much as digits as its factorization.
12010121131103 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 12010121131103 its reverse (30113112101021), we get a palindrome (42123233232124).
The spelling of 12010121131103 in words is "twelve trillion, ten billion, one hundred twenty-one million, one hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •