Base | Representation |
---|---|
bin | 10010111001110101… |
… | …10001010100011001 |
3 | 222012021211201211200 |
4 | 21130322301110121 |
5 | 131241101013300 |
6 | 4355020544413 |
7 | 506332520610 |
oct | 113472612431 |
9 | 28167751750 |
10 | 10148844825 |
11 | 4338838369 |
12 | 1b729b2109 |
13 | c597a3632 |
14 | 6c3c2a877 |
15 | 3e5eb0200 |
hex | 25ceb1519 |
10148844825 has 72 divisors (see below), whose sum is σ = 20794800000. Its totient is φ = 4634945280.
The previous prime is 10148844817. The next prime is 10148844847. The reversal of 10148844825 is 52844884101.
10148844825 is a `hidden beast` number, since 101 + 4 + 88 + 448 + 25 = 666.
10148844825 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10148844825 - 23 = 10148844817 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
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 71 ways as a sum of consecutive naturals, for example, 2027676 + ... + 2032674.
Almost surely, 210148844825 is an apocalyptic number.
10148844825 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10148844825 is an abundant number, since it is smaller than the sum of its proper divisors (10645955175).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10148844825 is a wasteful number, since it uses less digits than its factorization.
10148844825 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6311 (or 6303 counting only the distinct ones).
The product of its (nonzero) digits is 327680, while the sum is 45.
The spelling of 10148844825 in words is "ten billion, one hundred forty-eight million, eight hundred forty-four thousand, eight hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •