Base | Representation |
---|---|
bin | 1110001111100101110010… |
… | …10110001011000111111001 |
3 | 11002220100120210211222010102 |
4 | 13013302321112023013321 |
5 | 13101134434321320441 |
6 | 150341044441325145 |
7 | 6411640430452511 |
oct | 707627126130771 |
9 | 132810523758112 |
10 | 31322011120121 |
11 | 9a86654794607 |
12 | 361a4ba1967b5 |
13 | 1462864780007 |
14 | 7a3dc9d6c841 |
15 | 394b562c769b |
hex | 1c7cb958b1f9 |
31322011120121 has 8 divisors (see below), whose sum is σ = 32970881428320. Its totient is φ = 29673175152672.
The previous prime is 31322011120061. The next prime is 31322011120157. The reversal of 31322011120121 is 12102111022313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31322011120121 - 226 = 31321944011257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31322011120093 and 31322011120102.
It is not an unprimeable number, because it can be changed into a prime (31322011120321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6702395 + ... + 10371408.
It is an arithmetic number, because the mean of its divisors is an integer number (4121360178540).
Almost surely, 231322011120121 is an apocalyptic number.
It is an amenable number.
31322011120121 is a deficient number, since it is larger than the sum of its proper divisors (1648870308199).
31322011120121 is a wasteful number, since it uses less digits than its factorization.
31322011120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17170375.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 31322011120121 its reverse (12102111022313), we get a palindrome (43424122142434).
The spelling of 31322011120121 in words is "thirty-one trillion, three hundred twenty-two billion, eleven million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •