Base | Representation |
---|---|
bin | 11101101000001010001000… |
… | …101111101010011100000101 |
3 | 122002100211211221120212222002 |
4 | 131220022020233222130011 |
5 | 114034341032034201041 |
6 | 1141044213301115045 |
7 | 36306040052330336 |
oct | 3550121057523405 |
9 | 562324757525862 |
10 | 130303012022021 |
11 | 38578219326223 |
12 | 1274571b0b8a85 |
13 | 57926a1417337 |
14 | 24269b135628d |
15 | 100e7313c359b |
hex | 768288bea705 |
130303012022021 has 16 divisors (see below), whose sum is σ = 132224114880000. Its totient is φ = 128384312876400.
The previous prime is 130303012021939. The next prime is 130303012022033. The reversal of 130303012022021 is 120220210303031.
It is a cyclic number.
It is not a de Polignac number, because 130303012022021 - 234 = 130285832152837 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130303012021984 and 130303012022002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130303012022621) 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, 1030008230 + ... + 1030134728.
It is an arithmetic number, because the mean of its divisors is an integer number (8264007180000).
Almost surely, 2130303012022021 is an apocalyptic number.
It is an amenable number.
130303012022021 is a deficient number, since it is larger than the sum of its proper divisors (1921102857979).
130303012022021 is a wasteful number, since it uses less digits than its factorization.
130303012022021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135880.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 130303012022021 its reverse (120220210303031), we get a palindrome (250523222325052).
The spelling of 130303012022021 in words is "one hundred thirty trillion, three hundred three billion, twelve million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •