Base | Representation |
---|---|
bin | 10010110110100110… |
… | …00100101001100110 |
3 | 222010101200122200110 |
4 | 21123103010221212 |
5 | 131212121123110 |
6 | 4352210153450 |
7 | 505552461555 |
oct | 113323045146 |
9 | 28111618613 |
10 | 10121661030 |
11 | 4324460818 |
12 | 1b65882886 |
13 | c53c76450 |
14 | 6c0391d9c |
15 | 3e38e0a20 |
hex | 25b4c4a66 |
10121661030 has 128 divisors (see below), whose sum is σ = 26862409728. Its totient is φ = 2425231872.
The previous prime is 10121661013. The next prime is 10121661047. The reversal of 10121661030 is 3016612101.
It is an interprime number because it is at equal distance from previous prime (10121661013) and next prime (10121661047).
It is a junction number, because it is equal to n+sod(n) for n = 10121660988 and 10121661006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3609609 + ... + 3612411.
It is an arithmetic number, because the mean of its divisors is an integer number (209862576).
Almost surely, 210121661030 is an apocalyptic number.
10121661030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10121661030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13431204864).
10121661030 is an abundant number, since it is smaller than the sum of its proper divisors (16740748698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10121661030 is a wasteful number, since it uses less digits than its factorization.
10121661030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3070.
The product of its (nonzero) digits is 216, while the sum is 21.
The spelling of 10121661030 in words is "ten billion, one hundred twenty-one million, six hundred sixty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •