Base | Representation |
---|---|
bin | 11101100100000011110011… |
… | …011000001111100100100000 |
3 | 122001100220210021012022001001 |
4 | 131210003303120033210200 |
5 | 114020232142300000412 |
6 | 1140310550442321344 |
7 | 36246505563015322 |
oct | 3544036330174440 |
9 | 561326707168031 |
10 | 130021333203232 |
11 | 38479812a425a9 |
12 | 126bb0094b9254 |
13 | 5771c61221a73 |
14 | 24170cd569612 |
15 | 10072473b2957 |
hex | 7640f360f920 |
130021333203232 has 24 divisors (see below), whose sum is σ = 269452104994800. Its totient is φ = 61589052569664.
The previous prime is 130021333203221. The next prime is 130021333203239. The reversal of 130021333203232 is 232302333120031.
It is a self number, because there is not a number n which added to its sum of digits gives 130021333203232.
It is not an unprimeable number, because it can be changed into a prime (130021333203239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106925437882 + ... + 106925439097.
It is an arithmetic number, because the mean of its divisors is an integer number (11227171041450).
Almost surely, 2130021333203232 is an apocalyptic number.
It is an amenable number.
130021333203232 is an abundant number, since it is smaller than the sum of its proper divisors (139430771791568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130021333203232 is a wasteful number, since it uses less digits than its factorization.
130021333203232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213850877008 (or 213850877000 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 130021333203232 its reverse (232302333120031), we get a palindrome (362323666323263).
The spelling of 130021333203232 in words is "one hundred thirty trillion, twenty-one billion, three hundred thirty-three million, two hundred three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •