Base | Representation |
---|---|
bin | 1001001100010110111101… |
… | …0011111110100110100000 |
3 | 1022210022022201012112110222 |
4 | 2103011233103332212200 |
5 | 2311102012420234431 |
6 | 33255303352142212 |
7 | 2062162550416040 |
oct | 223055723764640 |
9 | 38708281175428 |
10 | 10107925555616 |
11 | 3247824510389 |
12 | 1172b97997968 |
13 | 584233944635 |
14 | 26d3249d9720 |
15 | 127de4d7057b |
hex | 9316f4fe9a0 |
10107925555616 has 48 divisors (see below), whose sum is σ = 22768473119616. Its totient is φ = 4327084167936.
The previous prime is 10107925555601. The next prime is 10107925555631. The reversal of 10107925555616 is 61655552970101.
It is an interprime number because it is at equal distance from previous prime (10107925555601) and next prime (10107925555631).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 25237991 + ... + 25635366.
It is an arithmetic number, because the mean of its divisors is an integer number (474343189992).
Almost surely, 210107925555616 is an apocalyptic number.
10107925555616 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10107925555616 is an abundant number, since it is smaller than the sum of its proper divisors (12660547564000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10107925555616 is an equidigital number, since it uses as much as digits as its factorization.
10107925555616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50874261 (or 50874253 counting only the distinct ones).
The product of its (nonzero) digits is 2835000, while the sum is 53.
The spelling of 10107925555616 in words is "ten trillion, one hundred seven billion, nine hundred twenty-five million, five hundred fifty-five thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •