Base | Representation |
---|---|
bin | 10111010010111100… |
… | …00011100000110110 |
3 | 1012021121221120210000 |
4 | 23221132003200312 |
5 | 201103231422010 |
6 | 5425014212130 |
7 | 621634635543 |
oct | 135136034066 |
9 | 35247846700 |
10 | 12506904630 |
11 | 5338904620 |
12 | 2510654046 |
13 | 12441965ac |
14 | 86908dbca |
15 | 4d2eee7c0 |
hex | 2e9783836 |
12506904630 has 80 divisors (see below), whose sum is σ = 36686946384. Its totient is φ = 3031974720.
The previous prime is 12506904629. The next prime is 12506904659. The reversal of 12506904630 is 3640960521.
It is a happy number.
12506904630 is a `hidden beast` number, since 1 + 2 + 506 + 90 + 4 + 63 + 0 = 666.
12506904630 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 39 ways as a sum of consecutive naturals, for example, 692937 + ... + 710756.
Almost surely, 212506904630 is an apocalyptic number.
12506904630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12506904630 is an abundant number, since it is smaller than the sum of its proper divisors (24180041754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12506904630 is a wasteful number, since it uses less digits than its factorization.
12506904630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1403723 (or 1403714 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
It can be divided in two parts, 1250690 and 4630, that added together give a triangular number (1255320 = T1584).
The spelling of 12506904630 in words is "twelve billion, five hundred six million, nine hundred four thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •