Base | Representation |
---|---|
bin | 10110100011001110… |
… | …01110001010111000 |
3 | 1011020201210202200010 |
4 | 23101213032022320 |
5 | 144243300420032 |
6 | 5321155341520 |
7 | 606004602330 |
oct | 132147161270 |
9 | 34221722603 |
10 | 12106654392 |
11 | 51529886a8 |
12 | 241a5b18a0 |
13 | 11ac298131 |
14 | 82bc620c0 |
15 | 4accdbccc |
hex | 2d19ce2b8 |
12106654392 has 64 divisors (see below), whose sum is σ = 34614478080. Its totient is φ = 3456640512.
The previous prime is 12106654319. The next prime is 12106654411. The reversal of 12106654392 is 29345660121.
12106654392 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 12106654392.
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, 224848 + ... + 273440.
It is an arithmetic number, because the mean of its divisors is an integer number (540851220).
Almost surely, 212106654392 is an apocalyptic number.
12106654392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12106654392 is an abundant number, since it is smaller than the sum of its proper divisors (22507823688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12106654392 is a wasteful number, since it uses less digits than its factorization.
12106654392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50092 (or 50088 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 39.
The spelling of 12106654392 in words is "twelve billion, one hundred six million, six hundred fifty-four thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •