Base | Representation |
---|---|
bin | 1010000001101010111111… |
… | …11110111101011011011011 |
3 | 2220001201220112212210121212 |
4 | 11000311133332331123123 |
5 | 10342212120413023202 |
6 | 114520321352453335 |
7 | 4433615000235320 |
oct | 500653776753333 |
9 | 86051815783555 |
10 | 22047677470427 |
11 | 7030405172044 |
12 | 2580ba26aa24b |
13 | c3c11938506b |
14 | 563182bc6b47 |
15 | 28379d886652 |
hex | 140d5ffbd6db |
22047677470427 has 8 divisors (see below), whose sum is σ = 25348227991296. Its totient is φ = 18784847527272.
The previous prime is 22047677470337. The next prime is 22047677470447. The reversal of 22047677470427 is 72407477674022.
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 22047677470427 - 218 = 22047677208283 is a prime.
It is a super-2 number, since 2×220476774704272 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22047677470447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9430143173 + ... + 9430145510.
It is an arithmetic number, because the mean of its divisors is an integer number (3168528498912).
Almost surely, 222047677470427 is an apocalyptic number.
22047677470427 is a deficient number, since it is larger than the sum of its proper divisors (3300550520869).
22047677470427 is a wasteful number, since it uses less digits than its factorization.
22047677470427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18860288857.
The product of its (nonzero) digits is 51631104, while the sum is 59.
The spelling of 22047677470427 in words is "twenty-two trillion, forty-seven billion, six hundred seventy-seven million, four hundred seventy thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •