Base | Representation |
---|---|
bin | 10001110110001000001… |
… | …101010111101110011100 |
3 | 11100020102111112210201100 |
4 | 101312020031113232130 |
5 | 130043031311321123 |
6 | 2335213335313100 |
7 | 154413055351650 |
oct | 21661015275634 |
9 | 4306374483640 |
10 | 1226350885788 |
11 | 433102116656 |
12 | 17981251b790 |
13 | 8b84b964812 |
14 | 434da07aa60 |
15 | 21d782a0643 |
hex | 11d88357b9c |
1226350885788 has 72 divisors (see below), whose sum is σ = 3595668981632. Its totient is φ = 345156321312.
The previous prime is 1226350885709. The next prime is 1226350885867. The reversal of 1226350885788 is 8875880536221.
It is a happy number.
1226350885788 is a `hidden beast` number, since 1 + 2 + 2 + 6 + 3 + 50 + 8 + 8 + 578 + 8 = 666.
It is an interprime number because it is at equal distance from previous prime (1226350885709) and next prime (1226350885867).
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36300070 + ... + 36333837.
Almost surely, 21226350885788 is an apocalyptic number.
1226350885788 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1226350885788 is an abundant number, since it is smaller than the sum of its proper divisors (2369318095844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1226350885788 is a wasteful number, since it uses less digits than its factorization.
1226350885788 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72633991 (or 72633986 counting only the distinct ones).
The product of its (nonzero) digits is 51609600, while the sum is 63.
The spelling of 1226350885788 in words is "one trillion, two hundred twenty-six billion, three hundred fifty million, eight hundred eighty-five thousand, seven hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •