Base | Representation |
---|---|
bin | 10010101011000101… |
… | …10011110110010000 |
3 | 221212200001000200212 |
4 | 21111202303312100 |
5 | 131012412420331 |
6 | 4334441103252 |
7 | 503301066323 |
oct | 112542636620 |
9 | 27780030625 |
10 | 10025123216 |
11 | 4284a144a9 |
12 | 1b39487b28 |
13 | c39c75794 |
14 | 6b16227ba |
15 | 3da1c1d2b |
hex | 2558b3d90 |
10025123216 has 80 divisors (see below), whose sum is σ = 21288667200. Its totient is φ = 4555160064.
The previous prime is 10025123203. The next prime is 10025123221. The reversal of 10025123216 is 61232152001.
It is a junction number, because it is equal to n+sod(n) for n = 10025123191 and 10025123200.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1380491 + ... + 1387733.
It is an arithmetic number, because the mean of its divisors is an integer number (266108340).
Almost surely, 210025123216 is an apocalyptic number.
10025123216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10025123216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10644333600).
10025123216 is an abundant number, since it is smaller than the sum of its proper divisors (11263543984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10025123216 is a wasteful number, since it uses less digits than its factorization.
10025123216 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7456 (or 7450 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 10025123216 its reverse (61232152001), we get a palindrome (71257275217).
The spelling of 10025123216 in words is "ten billion, twenty-five million, one hundred twenty-three thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •