Base | Representation |
---|---|
bin | 10111001100100101101001… |
… | …001101011011101110100101 |
3 | 111101020000202210201111102002 |
4 | 113030211221031123232211 |
5 | 101332444203031423023 |
6 | 1000551221520055045 |
7 | 30326465522025455 |
oct | 2714455115335645 |
9 | 441200683644362 |
10 | 102020123311013 |
11 | 2a563544a4a406 |
12 | b538224a64485 |
13 | 44c05c179ac2b |
14 | 1b29b2c0c5d65 |
15 | bbdb9e274b28 |
hex | 5cc96935bba5 |
102020123311013 has 8 divisors (see below), whose sum is σ = 102199628097600. Its totient is φ = 101840649150240.
The previous prime is 102020123310983. The next prime is 102020123311021. The reversal of 102020123311013 is 310113321020201.
It is a happy number.
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 102020123311013 - 214 = 102020123294629 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 (102020123311913) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 983120 + ... + 14318057.
It is an arithmetic number, because the mean of its divisors is an integer number (12774953512200).
Almost surely, 2102020123311013 is an apocalyptic number.
It is an amenable number.
102020123311013 is a deficient number, since it is larger than the sum of its proper divisors (179504786587).
102020123311013 is a wasteful number, since it uses less digits than its factorization.
102020123311013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15312907.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 102020123311013 its reverse (310113321020201), we get a palindrome (412133444331214).
The spelling of 102020123311013 in words is "one hundred two trillion, twenty billion, one hundred twenty-three million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •