Base | Representation |
---|---|
bin | 11101101000010010101000… |
… | …110100001110010101100100 |
3 | 122002101201102002112101111121 |
4 | 131220102220310032111210 |
5 | 114040013230321220030 |
6 | 1141052323133543324 |
7 | 36306512211135445 |
oct | 3550225064162544 |
9 | 562351362471447 |
10 | 130312140023140 |
11 | 385810828a35a9 |
12 | 12747448044b44 |
13 | 57934c756332a |
14 | 24271d976b2cc |
15 | 100eab793647a |
hex | 7684a8d0e564 |
130312140023140 has 48 divisors (see below), whose sum is σ = 274433183256960. Its totient is φ = 51976741052160.
The previous prime is 130312140023119. The next prime is 130312140023147. The reversal of 130312140023140 is 41320041213031.
It is not an unprimeable number, because it can be changed into a prime (130312140023147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129607999 + ... + 130609561.
It is an arithmetic number, because the mean of its divisors is an integer number (5717357984520).
Almost surely, 2130312140023140 is an apocalyptic number.
130312140023140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130312140023140 is an abundant number, since it is smaller than the sum of its proper divisors (144121043233820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130312140023140 is a wasteful number, since it uses less digits than its factorization.
130312140023140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020052 (or 1020050 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 130312140023140 its reverse (41320041213031), we get a palindrome (171632181236171).
The spelling of 130312140023140 in words is "one hundred thirty trillion, three hundred twelve billion, one hundred forty million, twenty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •