Base | Representation |
---|---|
bin | 11101100110110011100110… |
… | …110001101001111011110000 |
3 | 122002000222000202211111100102 |
4 | 131212303212301221323300 |
5 | 114031330241140301112 |
6 | 1140533405545011532 |
7 | 36266240446033463 |
oct | 3546634661517360 |
9 | 562028022744312 |
10 | 130210100322032 |
11 | 38541880074905 |
12 | 1272b70b183ba8 |
13 | 57869b52b8a73 |
14 | 24222b98792da |
15 | 100c0e45e5bc2 |
hex | 766ce6c69ef0 |
130210100322032 has 40 divisors (see below), whose sum is σ = 253107402113280. Its totient is φ = 64892407124160.
The previous prime is 130210100322007. The next prime is 130210100322037. The reversal of 130210100322032 is 230223001012031.
It is a junction number, because it is equal to n+sod(n) for n = 130210100321995 and 130210100322013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130210100322037) 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, 4793048 + ... + 16834295.
It is an arithmetic number, because the mean of its divisors is an integer number (6327685052832).
Almost surely, 2130210100322032 is an apocalyptic number.
It is an amenable number.
130210100322032 is a deficient number, since it is larger than the sum of its proper divisors (122897301791248).
130210100322032 is a wasteful number, since it uses less digits than its factorization.
130210100322032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21628581 (or 21628575 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 130210100322032 its reverse (230223001012031), we get a palindrome (360433101334063).
The spelling of 130210100322032 in words is "one hundred thirty trillion, two hundred ten billion, one hundred million, three hundred twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •