Base | Representation |
---|---|
bin | 10001110111111011100… |
… | …011011010011000010101 |
3 | 11100102102100220000021110 |
4 | 101313323203122120111 |
5 | 130111012211344134 |
6 | 2340133344405233 |
7 | 154512034051446 |
oct | 21677343323025 |
9 | 4312370800243 |
10 | 1228286043669 |
11 | 433a054a5393 |
12 | 17a072616819 |
13 | 8ba99857c59 |
14 | 436410972cd |
15 | 21e3d1057e9 |
hex | 11dfb8da615 |
1228286043669 has 8 divisors (see below), whose sum is σ = 1694187646560. Its totient is φ = 790620901616.
The previous prime is 1228286043653. The next prime is 1228286043683. The reversal of 1228286043669 is 9663406828221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1228286043669 - 24 = 1228286043653 is a prime.
It is a super-2 number, since 2×12282860436692 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1228286044669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7059115107 + ... + 7059115280.
It is an arithmetic number, because the mean of its divisors is an integer number (211773455820).
Almost surely, 21228286043669 is an apocalyptic number.
It is an amenable number.
1228286043669 is a deficient number, since it is larger than the sum of its proper divisors (465901602891).
1228286043669 is a wasteful number, since it uses less digits than its factorization.
1228286043669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14118230419.
The product of its (nonzero) digits is 11943936, while the sum is 57.
The spelling of 1228286043669 in words is "one trillion, two hundred twenty-eight billion, two hundred eighty-six million, forty-three thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •