Base | Representation |
---|---|
bin | 10011011010110001… |
… | …10100001010000000 |
3 | 222220112202210211012 |
4 | 21231120310022000 |
5 | 132322314444344 |
6 | 4442251140052 |
7 | 516226236320 |
oct | 115530641200 |
9 | 28815683735 |
10 | 10425156224 |
11 | 446a80219a |
12 | 202b444628 |
13 | ca1ac90c2 |
14 | 70c7d5280 |
15 | 41039029e |
hex | 26d634280 |
10425156224 has 32 divisors (see below), whose sum is σ = 23735848800. Its totient is φ = 4467923712.
The previous prime is 10425156221. The next prime is 10425156229. The reversal of 10425156224 is 42265152401.
It is a tau number, because it is divible by the number of its divisors (32).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (10425156221) 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 3 ways as a sum of consecutive naturals, for example, 5816714 + ... + 5818505.
It is an arithmetic number, because the mean of its divisors is an integer number (741745275).
Almost surely, 210425156224 is an apocalyptic number.
10425156224 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10425156224 is an abundant number, since it is smaller than the sum of its proper divisors (13310692576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10425156224 is an equidigital number, since it uses as much as digits as its factorization.
10425156224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11635240 (or 11635228 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
The spelling of 10425156224 in words is "ten billion, four hundred twenty-five million, one hundred fifty-six thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •