Base | Representation |
---|---|
bin | 10001110110000011111… |
… | …101011101000000000000 |
3 | 11100020020112102022210102 |
4 | 101312003331131000000 |
5 | 130042410034313344 |
6 | 2335202311421532 |
7 | 154411231436663 |
oct | 21660375350000 |
9 | 4306215368712 |
10 | 1226279604224 |
11 | 43307595a774 |
12 | 1797b26848a8 |
13 | 8b839c6788c |
14 | 434d08036da |
15 | 21d71dbee4e |
hex | 11d83f5d000 |
1226279604224 has 104 divisors (see below), whose sum is σ = 2471296780800. Its totient is φ = 608396902400.
The previous prime is 1226279604161. The next prime is 1226279604247. The reversal of 1226279604224 is 4224069726221.
It is a hoax number, since the sum of its digits (47) coincides with the sum of the digits of its distinct prime factors.
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 7 ways as a sum of consecutive naturals, for example, 351267119 + ... + 351270609.
Almost surely, 21226279604224 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1226279604224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1235648390400).
1226279604224 is an abundant number, since it is smaller than the sum of its proper divisors (1245017176576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1226279604224 is an equidigital number, since it uses as much as digits as its factorization.
1226279604224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4155 (or 4133 counting only the distinct ones).
The product of its (nonzero) digits is 1161216, while the sum is 47.
The spelling of 1226279604224 in words is "one trillion, two hundred twenty-six billion, two hundred seventy-nine million, six hundred four thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •