Base | Representation |
---|---|
bin | 1010011011010100010000… |
… | …01100011100010000001001 |
3 | 10000011222021220201212222021 |
4 | 11031222020030130100021 |
5 | 11001131211004420443 |
6 | 120433204335324441 |
7 | 4554360354406600 |
oct | 515521014342011 |
9 | 100158256655867 |
10 | 22928820388873 |
11 | 73400703a1413 |
12 | 26a3913680721 |
13 | ca4242193239 |
14 | 593a919d8a37 |
15 | 29b6706599ed |
hex | 14da8831c409 |
22928820388873 has 48 divisors (see below), whose sum is σ = 29022122188800. Its totient is φ = 17993205851040.
The previous prime is 22928820388867. The next prime is 22928820388879. The reversal of 22928820388873 is 37888302882922.
It is an interprime number because it is at equal distance from previous prime (22928820388867) and next prime (22928820388879).
It is not a de Polignac number, because 22928820388873 - 229 = 22928283517961 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22928820388879) 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 47 ways as a sum of consecutive naturals, for example, 20198586 + ... + 21303532.
It is an arithmetic number, because the mean of its divisors is an integer number (604627545600).
Almost surely, 222928820388873 is an apocalyptic number.
It is an amenable number.
22928820388873 is a deficient number, since it is larger than the sum of its proper divisors (6093301799927).
22928820388873 is a wasteful number, since it uses less digits than its factorization.
22928820388873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1105730 (or 1105723 counting only the distinct ones).
The product of its (nonzero) digits is 297271296, while the sum is 70.
The spelling of 22928820388873 in words is "twenty-two trillion, nine hundred twenty-eight billion, eight hundred twenty million, three hundred eighty-eight thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •