Base | Representation |
---|---|
bin | 11101101000011011110100… |
… | …100001110100001000010010 |
3 | 122002102122212021012021121221 |
4 | 131220123310201310020102 |
5 | 114040143424022401320 |
6 | 1141101033403435254 |
7 | 36310311440225410 |
oct | 3550336441641022 |
9 | 562378767167557 |
10 | 130322000200210 |
11 | 38585282697575 |
12 | 1274933a225b2a |
13 | 57944092a5c30 |
14 | 24278930d42b0 |
15 | 100ee933c53aa |
hex | 7686f4874212 |
130322000200210 has 64 divisors (see below), whose sum is σ = 291268339955712. Its totient is φ = 40879766946816.
The previous prime is 130322000200177. The next prime is 130322000200211. The reversal of 130322000200210 is 12002000223031.
It is not an unprimeable number, because it can be changed into a prime (130322000200211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 633574114 + ... + 633779773.
It is an arithmetic number, because the mean of its divisors is an integer number (4551067811808).
Almost surely, 2130322000200210 is an apocalyptic number.
130322000200210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130322000200210 is an abundant number, since it is smaller than the sum of its proper divisors (160946339755502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130322000200210 is a wasteful number, since it uses less digits than its factorization.
130322000200210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1267354027.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 130322000200210 its reverse (12002000223031), we get a palindrome (142324000423241).
The spelling of 130322000200210 in words is "one hundred thirty trillion, three hundred twenty-two billion, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •