Base | Representation |
---|---|
bin | 1110000110010000010001… |
… | …10101100100011110110001 |
3 | 11001202200120110220112201112 |
4 | 13003020020311210132301 |
5 | 13030411000341001223 |
6 | 145533433113443105 |
7 | 6346523120610215 |
oct | 703101065443661 |
9 | 131680513815645 |
10 | 31001222203313 |
11 | 99725a980842a |
12 | 35882b2710495 |
13 | 143b5309a44cb |
14 | 792677c62945 |
15 | 38b62d9b4778 |
hex | 1c3208d647b1 |
31001222203313 has 32 divisors (see below), whose sum is σ = 33138081715200. Its totient is φ = 28931659517376.
The previous prime is 31001222203297. The next prime is 31001222203327. The reversal of 31001222203313 is 31330222210013.
It is a cyclic number.
It is not a de Polignac number, because 31001222203313 - 24 = 31001222203297 is a prime.
It is a super-2 number, since 2×310012222033132 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31001222203363) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4976914883 + ... + 4976921111.
It is an arithmetic number, because the mean of its divisors is an integer number (1035565053600).
Almost surely, 231001222203313 is an apocalyptic number.
It is an amenable number.
31001222203313 is a deficient number, since it is larger than the sum of its proper divisors (2136859511887).
31001222203313 is a wasteful number, since it uses less digits than its factorization.
31001222203313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11061.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 31001222203313 its reverse (31330222210013), we get a palindrome (62331444413326).
The spelling of 31001222203313 in words is "thirty-one trillion, one billion, two hundred twenty-two million, two hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •