Base | Representation |
---|---|
bin | 1110001111010101011000… |
… | …01011001110110001110011 |
3 | 11002212111211202120111221000 |
4 | 13013222230023032301303 |
5 | 13101013413223304412 |
6 | 150333030253133043 |
7 | 6411206202131121 |
oct | 707525413166163 |
9 | 132774752514830 |
10 | 31313200213107 |
11 | 9a8294320677a |
12 | 361885b48a183 |
13 | 1461a8c238677 |
14 | 7a37d1ada911 |
15 | 3947dc9ed4dc |
hex | 1c7aac2cec73 |
31313200213107 has 32 divisors (see below), whose sum is σ = 47075553216000. Its totient is φ = 20567337769440.
The previous prime is 31313200213093. The next prime is 31313200213123. The reversal of 31313200213107 is 70131200231313.
It is a happy number.
31313200213107 is a `hidden beast` number, since 3 + 1 + 3 + 1 + 320 + 0 + 21 + 310 + 7 = 666.
It is not a de Polignac number, because 31313200213107 - 24 = 31313200213091 is a prime.
It is a super-2 number, since 2×313132002131072 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (31313200213157) 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, 2800932 + ... + 8394737.
It is an arithmetic number, because the mean of its divisors is an integer number (1471111038000).
Almost surely, 231313200213107 is an apocalyptic number.
31313200213107 is a deficient number, since it is larger than the sum of its proper divisors (15762353002893).
31313200213107 is a wasteful number, since it uses less digits than its factorization.
31313200213107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11197208 (or 11197202 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The spelling of 31313200213107 in words is "thirty-one trillion, three hundred thirteen billion, two hundred million, two hundred thirteen thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •