Base | Representation |
---|---|
bin | 11011100000111101011111… |
… | …001010010011100101111101 |
3 | 120212110122220021000101100022 |
4 | 123200331133022103211331 |
5 | 111330131142311231023 |
6 | 1105212141101141525 |
7 | 34326564415113005 |
oct | 3340753712234575 |
9 | 525418807011308 |
10 | 121012300102013 |
11 | 35616034694871 |
12 | 116a4bb255a8a5 |
13 | 526a545a92388 |
14 | 21c5052cd3005 |
15 | decc1ab6b7c8 |
hex | 6e0f5f29397d |
121012300102013 has 32 divisors (see below), whose sum is σ = 124396790169600. Its totient is φ = 117673523323200.
The previous prime is 121012300102009. The next prime is 121012300102081. The reversal of 121012300102013 is 310201003210121.
It is a cyclic number.
It is not a de Polignac number, because 121012300102013 - 22 = 121012300102009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121012300101982 and 121012300102000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121012300101013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7993406798 + ... + 7993421936.
It is an arithmetic number, because the mean of its divisors is an integer number (3887399692800).
Almost surely, 2121012300102013 is an apocalyptic number.
It is an amenable number.
121012300102013 is a deficient number, since it is larger than the sum of its proper divisors (3384490067587).
121012300102013 is a wasteful number, since it uses less digits than its factorization.
121012300102013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18233.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 121012300102013 its reverse (310201003210121), we get a palindrome (431213303312134).
The spelling of 121012300102013 in words is "one hundred twenty-one trillion, twelve billion, three hundred million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •