Base | Representation |
---|---|
bin | 10111001100100101101101… |
… | …110110100100010110111010 |
3 | 111101020000222020021211022022 |
4 | 113030211231312210112322 |
5 | 101332444333002000010 |
6 | 1000551233341354442 |
7 | 30326500456062260 |
oct | 2714455566442672 |
9 | 441200866254268 |
10 | 102020201203130 |
11 | 2a563584a10961 |
12 | b538246b68a22 |
13 | 44c0604970a42 |
14 | 1b29b385a0430 |
15 | bbdba600dd55 |
hex | 5cc96dda45ba |
102020201203130 has 32 divisors (see below), whose sum is σ = 214335450072576. Its totient is φ = 34234134384384.
The previous prime is 102020201203121. The next prime is 102020201203133. The reversal of 102020201203130 is 31302102020201.
It is a junction number, because it is equal to n+sod(n) for n = 102020201203099 and 102020201203108.
It is not an unprimeable number, because it can be changed into a prime (102020201203133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15504586559 + ... + 15504593138.
It is an arithmetic number, because the mean of its divisors is an integer number (6697982814768).
Almost surely, 2102020201203130 is an apocalyptic number.
102020201203130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102020201203130 is an abundant number, since it is smaller than the sum of its proper divisors (112315248869446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020201203130 is a wasteful number, since it uses less digits than its factorization.
102020201203130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31009179758.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 102020201203130 its reverse (31302102020201), we get a palindrome (133322303223331).
The spelling of 102020201203130 in words is "one hundred two trillion, twenty billion, two hundred one million, two hundred three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •