Base | Representation |
---|---|
bin | 1010000110111110101001… |
… | …10000101110110000110101 |
3 | 2220201011120200111101000002 |
4 | 11003133110300232300311 |
5 | 10403204042434113140 |
6 | 115140155503401045 |
7 | 4453031515230542 |
oct | 503372460566065 |
9 | 86634520441002 |
10 | 22230025301045 |
11 | 70a0778824101 |
12 | 25b03b25b3185 |
13 | c5338954a5a3 |
14 | 56bd20741bc9 |
15 | 2883c225d415 |
hex | 1437d4c2ec35 |
22230025301045 has 8 divisors (see below), whose sum is σ = 26679319280640. Its totient is φ = 17781827627920.
The previous prime is 22230025300969. The next prime is 22230025301089. The reversal of 22230025301045 is 54010352003222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22230025301045 - 28 = 22230025300789 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22230025300999 and 22230025301017.
It is a congruent number.
It is an unprimeable number.
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, 274032005 + ... + 274113114.
It is an arithmetic number, because the mean of its divisors is an integer number (3334914910080).
Almost surely, 222230025301045 is an apocalyptic number.
It is an amenable number.
22230025301045 is a deficient number, since it is larger than the sum of its proper divisors (4449293979595).
22230025301045 is an equidigital number, since it uses as much as digits as its factorization.
22230025301045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 548153235.
The product of its (nonzero) digits is 14400, while the sum is 29.
Adding to 22230025301045 its reverse (54010352003222), we get a palindrome (76240377304267).
The spelling of 22230025301045 in words is "twenty-two trillion, two hundred thirty billion, twenty-five million, three hundred one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •