Base | Representation |
---|---|
bin | 10010101011001100… |
… | …01001010001100000 |
3 | 221212201200102212100 |
4 | 21111212021101200 |
5 | 131013123404113 |
6 | 4334511530400 |
7 | 503311400100 |
oct | 112546112140 |
9 | 27781612770 |
10 | 10025997408 |
11 | 4285461279 |
12 | 1b39829a00 |
13 | c3a1c065b |
14 | 6b17ad200 |
15 | 3da2e5d73 |
hex | 255989460 |
10025997408 has 108 divisors (see below), whose sum is σ = 33166404180. Its totient is φ = 2864566656.
The previous prime is 10025997407. The next prime is 10025997419. The reversal of 10025997408 is 80479952001.
10025997408 is a `hidden beast` number, since 10 + 0 + 2 + 599 + 7 + 40 + 8 = 666.
It is a super-3 number, since 3×100259974083 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10025997407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 341118 + ... + 369341.
It is an arithmetic number, because the mean of its divisors is an integer number (307096335).
Almost surely, 210025997408 is an apocalyptic number.
10025997408 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
10025997408 is an abundant number, since it is smaller than the sum of its proper divisors (23140406772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10025997408 is a wasteful number, since it uses less digits than its factorization.
10025997408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710489 (or 710471 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 45.
The spelling of 10025997408 in words is "ten billion, twenty-five million, nine hundred ninety-seven thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •