Base | Representation |
---|---|
bin | 111100101000100011… |
… | …1101111010001100101 |
3 | 110110002120002110020110 |
4 | 1321101013233101211 |
5 | 4113132230031041 |
6 | 135452340123233 |
7 | 12256503520101 |
oct | 1712107572145 |
9 | 413076073213 |
10 | 130210002021 |
11 | 50249173820 |
12 | 2129b096519 |
13 | c381551598 |
14 | 6433332901 |
15 | 35c14e6516 |
hex | 1e511ef465 |
130210002021 has 8 divisors (see below), whose sum is σ = 189396366624. Its totient is φ = 78915152720.
The previous prime is 130210002007. The next prime is 130210002029. The reversal of 130210002021 is 120200012031.
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 130210002021 - 210 = 130210000997 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130210001988 and 130210002006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130210002029) 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, 1972878786 + ... + 1972878851.
It is an arithmetic number, because the mean of its divisors is an integer number (23674545828).
Almost surely, 2130210002021 is an apocalyptic number.
130210002021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130210002021 is a deficient number, since it is larger than the sum of its proper divisors (59186364603).
130210002021 is a wasteful number, since it uses less digits than its factorization.
130210002021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3945757651.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 130210002021 its reverse (120200012031), we get a palindrome (250410014052).
The spelling of 130210002021 in words is "one hundred thirty billion, two hundred ten million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •