Base | Representation |
---|---|
bin | 10111110100111100… |
… | …00000110001010110 |
3 | 1020000111121022121022 |
4 | 23322132000301112 |
5 | 202144234343240 |
6 | 5513203121142 |
7 | 632000051612 |
oct | 137236006126 |
9 | 36014538538 |
10 | 12792106070 |
11 | 54748a0697 |
12 | 25900731b2 |
13 | 128b2b2643 |
14 | 894cd0342 |
15 | 4ed0889b5 |
hex | 2fa780c56 |
12792106070 has 8 divisors (see below), whose sum is σ = 23025790944. Its totient is φ = 5116842424.
The previous prime is 12792106057. The next prime is 12792106091. The reversal of 12792106070 is 7060129721.
12792106070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×127921060702 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12792106070.
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 3 ways as a sum of consecutive naturals, for example, 639605294 + ... + 639605313.
It is an arithmetic number, because the mean of its divisors is an integer number (2878223868).
Almost surely, 212792106070 is an apocalyptic number.
12792106070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12792106070 is a deficient number, since it is larger than the sum of its proper divisors (10233684874).
12792106070 is a wasteful number, since it uses less digits than its factorization.
12792106070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1279210614.
The product of its (nonzero) digits is 10584, while the sum is 35.
The spelling of 12792106070 in words is "twelve billion, seven hundred ninety-two million, one hundred six thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •