Base | Representation |
---|---|
bin | 1110001111000000101111… |
… | …11000000101000100000110 |
3 | 11002211110020201101200000012 |
4 | 13013200113320011010012 |
5 | 13100323221242330042 |
6 | 150323555121350222 |
7 | 6410334524622260 |
oct | 707402770050406 |
9 | 132743221350005 |
10 | 31302122230022 |
11 | 9a79178a55056 |
12 | 3616689498372 |
13 | 1460a151089a7 |
14 | 7a306072ab30 |
15 | 3943901a7e82 |
hex | 1c7817e05106 |
31302122230022 has 64 divisors (see below), whose sum is σ = 54422348414976. Its totient is φ = 13226345677440.
The previous prime is 31302122230021. The next prime is 31302122230037. The reversal of 31302122230022 is 22003222120313.
It is a super-2 number, since 2×313021222300222 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31302122230022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31302122230021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 218279168 + ... + 218422524.
It is an arithmetic number, because the mean of its divisors is an integer number (850349193984).
Almost surely, 231302122230022 is an apocalyptic number.
31302122230022 is a deficient number, since it is larger than the sum of its proper divisors (23120226184954).
31302122230022 is a wasteful number, since it uses less digits than its factorization.
31302122230022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144261.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 31302122230022 its reverse (22003222120313), we get a palindrome (53305344350335).
The spelling of 31302122230022 in words is "thirty-one trillion, three hundred two billion, one hundred twenty-two million, two hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •