Base | Representation |
---|---|
bin | 111100101000100100… |
… | …0000111011100011101 |
3 | 110110002120021111001010 |
4 | 1321101020013130131 |
5 | 4113132241213041 |
6 | 135452342205433 |
7 | 12256504411530 |
oct | 1712110073435 |
9 | 413076244033 |
10 | 130210101021 |
11 | 50249231140 |
12 | 2129b123879 |
13 | c381587670 |
14 | 643335aa17 |
15 | 35c1515a16 |
hex | 1e5120771d |
130210101021 has 128 divisors (see below), whose sum is σ = 236304617472. Its totient is φ = 61585920000.
The previous prime is 130210101011. The next prime is 130210101029. The reversal of 130210101021 is 120101012031.
It is not a de Polignac number, because 130210101021 - 26 = 130210100957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130210100988 and 130210101006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130210101029) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 100392645 + ... + 100393941.
It is an arithmetic number, because the mean of its divisors is an integer number (1846129824).
Almost surely, 2130210101021 is an apocalyptic number.
130210101021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130210101021 is a deficient number, since it is larger than the sum of its proper divisors (106094516451).
130210101021 is a wasteful number, since it uses less digits than its factorization.
130210101021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1763.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 130210101021 its reverse (120101012031), we get a palindrome (250311113052).
It can be divided in two parts, 13021010 and 1021, that added together give a palindrome (13022031).
The spelling of 130210101021 in words is "one hundred thirty billion, two hundred ten million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •