Base | Representation |
---|---|
bin | 1011000000111001101110… |
… | …0010000010101111001101 |
3 | 1120212201100020102111001221 |
4 | 2300032123202002233031 |
5 | 3041403012240400023 |
6 | 41431151403003341 |
7 | 2356633055166145 |
oct | 260163342025715 |
9 | 46781306374057 |
10 | 12110122200013 |
11 | 39499682a9662 |
12 | 1437033509551 |
13 | 69ac97303b96 |
14 | 2dc1c10d1925 |
15 | 16002ab0585d |
hex | b039b882bcd |
12110122200013 has 2 divisors, whose sum is σ = 12110122200014. Its totient is φ = 12110122200012.
The previous prime is 12110122199999. The next prime is 12110122200053. The reversal of 12110122200013 is 31000222101121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8434627403049 + 3675494796964 = 2904243^2 + 1917158^2 .
It is a cyclic number.
It is not a de Polignac number, because 12110122200013 - 29 = 12110122199501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12110122200013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12110122200053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055061100006 + 6055061100007.
It is an arithmetic number, because the mean of its divisors is an integer number (6055061100007).
Almost surely, 212110122200013 is an apocalyptic number.
It is an amenable number.
12110122200013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110122200013 is an equidigital number, since it uses as much as digits as its factorization.
12110122200013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 12110122200013 its reverse (31000222101121), we get a palindrome (43110344301134).
The spelling of 12110122200013 in words is "twelve trillion, one hundred ten billion, one hundred twenty-two million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •