Base | Representation |
---|---|
bin | 1110001111010001010010… |
… | …00111001010010101001110 |
3 | 11002212022011111222201202210 |
4 | 13013220221013022111032 |
5 | 13100444412320043042 |
6 | 150332024143331250 |
7 | 6411100542006150 |
oct | 707505107122516 |
9 | 132768144881683 |
10 | 31311001331022 |
11 | 9a81a14a80056 |
12 | 3618346bb0b26 |
13 | 14617cb808aca |
14 | 7a3663a70ad0 |
15 | 39470e952a9c |
hex | 1c7a291ca54e |
31311001331022 has 16 divisors (see below), whose sum is σ = 71568003042432. Its totient is φ = 8946000380280.
The previous prime is 31311001331017. The next prime is 31311001331041. The reversal of 31311001331022 is 22013310011313.
It is a happy number.
It is a super-2 number, since 2×313110013310222 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 31311001331022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 372750015804 + ... + 372750015887.
It is an arithmetic number, because the mean of its divisors is an integer number (4473000190152).
Almost surely, 231311001331022 is an apocalyptic number.
31311001331022 is an abundant number, since it is smaller than the sum of its proper divisors (40257001711410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31311001331022 is a wasteful number, since it uses less digits than its factorization.
31311001331022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 745500031703.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 31311001331022 its reverse (22013310011313), we get a palindrome (53324311342335).
The spelling of 31311001331022 in words is "thirty-one trillion, three hundred eleven billion, one million, three hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •