Base | Representation |
---|---|
bin | 10111010001100110… |
… | …10111000010111000 |
3 | 1012020211212221222110 |
4 | 23220303113002320 |
5 | 201042400244230 |
6 | 5423534252320 |
7 | 621440542341 |
oct | 135063270270 |
9 | 35224787873 |
10 | 12495712440 |
11 | 533255a782 |
12 | 25089570a0 |
13 | 1241a781b3 |
14 | 8677b90c8 |
15 | 4d203d4b0 |
hex | 2e8cd70b8 |
12495712440 has 64 divisors (see below), whose sum is σ = 37625564160. Its totient is φ = 3319885440.
The previous prime is 12495712433. The next prime is 12495712451. The reversal of 12495712440 is 4421759421.
12495712440 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×124957124402 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 159604 + ... + 224643.
It is an arithmetic number, because the mean of its divisors is an integer number (587899440).
Almost surely, 212495712440 is an apocalyptic number.
12495712440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12495712440 is an abundant number, since it is smaller than the sum of its proper divisors (25129851720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12495712440 is a wasteful number, since it uses less digits than its factorization.
12495712440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384532 (or 384528 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 39.
The spelling of 12495712440 in words is "twelve billion, four hundred ninety-five million, seven hundred twelve thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •