Base | Representation |
---|---|
bin | 11101001010011010… |
… | …000111011000010111 |
3 | 2222211021011212111202 |
4 | 131022122013120113 |
5 | 1003112130143111 |
6 | 22215101023115 |
7 | 2155653136130 |
oct | 351232073027 |
9 | 88737155452 |
10 | 31313131031 |
11 | 1230949a896 |
12 | 609a854a9b |
13 | 2c50449b00 |
14 | 17309c6c87 |
15 | c3405eb3b |
hex | 74a687617 |
31313131031 has 48 divisors (see below), whose sum is σ = 41381775360. Its totient is φ = 23148478080.
The previous prime is 31313131021. The next prime is 31313131139. The reversal of 31313131031 is 13013131313.
It is not a de Polignac number, because 31313131031 - 218 = 31312868887 is a prime.
It is a super-2 number, since 2×313131310312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31313130994 and 31313131012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31313131021) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1048796 + ... + 1078238.
It is an arithmetic number, because the mean of its divisors is an integer number (862120320).
Almost surely, 231313131031 is an apocalyptic number.
31313131031 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
31313131031 is a deficient number, since it is larger than the sum of its proper divisors (10068644329).
31313131031 is a wasteful number, since it uses less digits than its factorization.
31313131031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29536 (or 29523 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 31313131031 its reverse (13013131313), we get a palindrome (44326262344).
The spelling of 31313131031 in words is "thirty-one billion, three hundred thirteen million, one hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •