Base | Representation |
---|---|
bin | 1001001100100000010111… |
… | …1100001010011010000010 |
3 | 1022210112211211102100121220 |
4 | 2103020011330022122002 |
5 | 2311122201341002010 |
6 | 33300402225055510 |
7 | 2062312304513466 |
oct | 223100574123202 |
9 | 38715754370556 |
10 | 10110452672130 |
11 | 3248900a55428 |
12 | 1173582187596 |
13 | 584547379455 |
14 | 26d4c44a84a6 |
15 | 127ee1b55970 |
hex | 93205f0a682 |
10110452672130 has 64 divisors (see below), whose sum is σ = 24375557743488. Its totient is φ = 2683867028480.
The previous prime is 10110452672107. The next prime is 10110452672149. The reversal of 10110452672130 is 3127625401101.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10110452672091 and 10110452672100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7091197 + ... + 8396783.
It is an arithmetic number, because the mean of its divisors is an integer number (380868089742).
Almost surely, 210110452672130 is an apocalyptic number.
10110452672130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10110452672130 is an abundant number, since it is smaller than the sum of its proper divisors (14265105071358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110452672130 is a wasteful number, since it uses less digits than its factorization.
10110452672130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1306771.
The product of its (nonzero) digits is 10080, while the sum is 33.
The spelling of 10110452672130 in words is "ten trillion, one hundred ten billion, four hundred fifty-two million, six hundred seventy-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •