Base | Representation |
---|---|
bin | 1001001101000100000000… |
… | …1100101101011101011010 |
3 | 1022211110112121002010220020 |
4 | 2103101000030231131122 |
5 | 2311301300111220010 |
6 | 33305023434411310 |
7 | 2063101346613213 |
oct | 223210014553532 |
9 | 38743477063806 |
10 | 10120020023130 |
11 | 3251970524886 |
12 | 11753b2290b36 |
13 | 5854105336a4 |
14 | 26db50da840a |
15 | 1283a1a51470 |
hex | 9344032d75a |
10120020023130 has 32 divisors (see below), whose sum is σ = 24290104950144. Its totient is φ = 2698443462336.
The previous prime is 10120020023089. The next prime is 10120020023137. The reversal of 10120020023130 is 3132002002101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (10120020023137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13923694 + ... + 14632473.
It is an arithmetic number, because the mean of its divisors is an integer number (759065779692).
Almost surely, 210120020023130 is an apocalyptic number.
10120020023130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10120020023130 is an abundant number, since it is smaller than the sum of its proper divisors (14170084927014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10120020023130 is a wasteful number, since it uses less digits than its factorization.
10120020023130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28567990.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10120020023130 its reverse (3132002002101), we get a palindrome (13252022025231).
The spelling of 10120020023130 in words is "ten trillion, one hundred twenty billion, twenty million, twenty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •