Base | Representation |
---|---|
bin | 11101101000011011110101… |
… | …001111101000011101000010 |
3 | 122002102122220002210111100101 |
4 | 131220123311033220131002 |
5 | 114040143440111223020 |
6 | 1141101034513113014 |
7 | 36310311644301334 |
oct | 3550336517503502 |
9 | 562378802714311 |
10 | 130322012211010 |
11 | 38585289450454 |
12 | 1274934225876a |
13 | 579440b91cb09 |
14 | 242789493d454 |
15 | 100ee9449900a |
hex | 7686f53e8742 |
130322012211010 has 32 divisors (see below), whose sum is σ = 237631499366400. Its totient is φ = 51451068327360.
The previous prime is 130322012211007. The next prime is 130322012211031. The reversal of 130322012211010 is 10112210223031.
130322012211010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26375221 + ... + 30924040.
It is an arithmetic number, because the mean of its divisors is an integer number (7425984355200).
Almost surely, 2130322012211010 is an apocalyptic number.
130322012211010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130322012211010 is a deficient number, since it is larger than the sum of its proper divisors (107309487155390).
130322012211010 is a wasteful number, since it uses less digits than its factorization.
130322012211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57302226.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 130322012211010 its reverse (10112210223031), we get a palindrome (140434222434041).
The spelling of 130322012211010 in words is "one hundred thirty trillion, three hundred twenty-two billion, twelve million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •