Base | Representation |
---|---|
bin | 10111001000111001… |
… | …10011011011000001 |
3 | 1012001202111001201001 |
4 | 23210130303123001 |
5 | 200420202043442 |
6 | 5412405212001 |
7 | 616563061360 |
oct | 134434633301 |
9 | 35052431631 |
10 | 12422690497 |
11 | 52a5315268 |
12 | 24a8401001 |
13 | 122c8bc049 |
14 | 85bc0b7d7 |
15 | 4ca9172b7 |
hex | 2e47336c1 |
12422690497 has 32 divisors (see below), whose sum is σ = 14796852224. Its totient is φ = 10208721600.
The previous prime is 12422690431. The next prime is 12422690521. The reversal of 12422690497 is 79409622421.
12422690497 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Cunningham number, because it is equal to 23163+1.
It is a de Polignac number, because none of the positive numbers 2k-12422690497 is a prime.
It is a taxicab number since it can be written as a sum of two cubes in more than one way. Here 12422690497 = 13 + 23163 = 5773 + 23043.
It is not an unprimeable number, because it can be changed into a prime (12422690417) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 6674347 + ... + 6676207.
It is an arithmetic number, because the mean of its divisors is an integer number (462401632).
Almost surely, 212422690497 is an apocalyptic number.
It is an amenable number.
12422690497 is a deficient number, since it is larger than the sum of its proper divisors (2374161727).
12422690497 is a wasteful number, since it uses less digits than its factorization.
12422690497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2309.
The product of its (nonzero) digits is 435456, while the sum is 46.
The spelling of 12422690497 in words is "twelve billion, four hundred twenty-two million, six hundred ninety thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •