Base | Representation |
---|---|
bin | 1110001111100010101010… |
… | …10101011010101110111000 |
3 | 11002220012020212112210212022 |
4 | 13013301111111122232320 |
5 | 13101123020244402222 |
6 | 150340210141534012 |
7 | 6411551024412152 |
oct | 707612525325670 |
9 | 132805225483768 |
10 | 31320333200312 |
11 | 9a85973632622 |
12 | 361a110274308 |
13 | 1462657c64960 |
14 | 7a3cab193ad2 |
15 | 394aa8d36042 |
hex | 1c7c5555abb8 |
31320333200312 has 32 divisors (see below), whose sum is σ = 64043524574400. Its totient is φ = 14272556897664.
The previous prime is 31320333200267. The next prime is 31320333200323. The reversal of 31320333200312 is 21300233302313.
It is a happy number.
It is a super-2 number, since 2×313203332003122 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
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, 1906049063 + ... + 1906065494.
It is an arithmetic number, because the mean of its divisors is an integer number (2001360142950).
Almost surely, 231320333200312 is an apocalyptic number.
It is an amenable number.
31320333200312 is an abundant number, since it is smaller than the sum of its proper divisors (32723191374088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31320333200312 is a wasteful number, since it uses less digits than its factorization.
31320333200312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3812114655 (or 3812114651 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 31320333200312 its reverse (21300233302313), we get a palindrome (52620566502625).
The spelling of 31320333200312 in words is "thirty-one trillion, three hundred twenty billion, three hundred thirty-three million, two hundred thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •