Base | Representation |
---|---|
bin | 11101101000010010100010… |
… | …010100011100111100111100 |
3 | 122002101201010111110000112101 |
4 | 131220102202110130330330 |
5 | 114040013014420443400 |
6 | 1141052304241514444 |
7 | 36306506415542422 |
oct | 3550224224347474 |
9 | 562351114400471 |
10 | 130312031031100 |
11 | 38581027320236 |
12 | 12747417642a24 |
13 | 57934aaac19b9 |
14 | 24271c90b9112 |
15 | 100eaad0a756a |
hex | 7684a251cf3c |
130312031031100 has 36 divisors (see below), whose sum is σ = 283216885249144. Its totient is φ = 52043747359680.
The previous prime is 130312031031089. The next prime is 130312031031101. The reversal of 130312031031100 is 1130130213031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130312031031101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1013248539 + ... + 1013377138.
Almost surely, 2130312031031100 is an apocalyptic number.
130312031031100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130312031031100 is an abundant number, since it is smaller than the sum of its proper divisors (152904854218044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130312031031100 is a wasteful number, since it uses less digits than its factorization.
130312031031100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2026626334 (or 2026626327 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 130312031031100 its reverse (1130130213031), we get a palindrome (131442161244131).
The spelling of 130312031031100 in words is "one hundred thirty trillion, three hundred twelve billion, thirty-one million, thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •