Base | Representation |
---|---|
bin | 10110110101100000… |
… | …01100001010111110 |
3 | 1011122102100112220121 |
4 | 23122300030022332 |
5 | 200102030003241 |
6 | 5344314205154 |
7 | 612546166351 |
oct | 133260141276 |
9 | 34572315817 |
10 | 12260000446 |
11 | 52214a5881 |
12 | 2461a237ba |
13 | 1204c99045 |
14 | 84437c298 |
15 | 4bb4ccad1 |
hex | 2dac0c2be |
12260000446 has 8 divisors (see below), whose sum is σ = 18596630160. Its totient is φ = 6061123728.
The previous prime is 12260000387. The next prime is 12260000471. The reversal of 12260000446 is 64400006221.
12260000446 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×122600004462 (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 12260000446.
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, 34438026 + ... + 34438381.
It is an arithmetic number, because the mean of its divisors is an integer number (2324578770).
Almost surely, 212260000446 is an apocalyptic number.
12260000446 is a deficient number, since it is larger than the sum of its proper divisors (6336629714).
12260000446 is an equidigital number, since it uses as much as digits as its factorization.
12260000446 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68876498.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 12260000446 its reverse (64400006221), we get a palindrome (76660006667).
The spelling of 12260000446 in words is "twelve billion, two hundred sixty million, four hundred forty-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •