Base | Representation |
---|---|
bin | 1010001110110000000110… |
… | …01000001001000100000000 |
3 | 2221122200220222000210210020 |
4 | 11013120003020021010000 |
5 | 10422043020314143433 |
6 | 115503004311533440 |
7 | 4511234614500204 |
oct | 507300310110400 |
9 | 87580828023706 |
10 | 22497091162368 |
11 | 7193a65510579 |
12 | 263410638a280 |
13 | c7260b14c674 |
14 | 57ac17898b04 |
15 | 29030340dcb3 |
hex | 147603209100 |
22497091162368 has 72 divisors (see below), whose sum is σ = 59958347702400. Its totient is φ = 7488600397824.
The previous prime is 22497091162363. The next prime is 22497091162369. The reversal of 22497091162368 is 86326119079422.
It is a happy number.
It is a super-2 number, since 2×224970911623682 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22497091162363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19818523 + ... + 20922906.
It is an arithmetic number, because the mean of its divisors is an integer number (832754829200).
Almost surely, 222497091162368 is an apocalyptic number.
It is an amenable number.
22497091162368 is an abundant number, since it is smaller than the sum of its proper divisors (37461256540032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22497091162368 is an equidigital number, since it uses as much as digits as its factorization.
22497091162368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40742167 (or 40742153 counting only the distinct ones).
The product of its (nonzero) digits is 15676416, while the sum is 60.
The spelling of 22497091162368 in words is "twenty-two trillion, four hundred ninety-seven billion, ninety-one million, one hundred sixty-two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •