Base | Representation |
---|---|
bin | 11100111001000111… |
… | …110110101010111001 |
3 | 2222002001111100200202 |
4 | 130321013312222321 |
5 | 1002013410200241 |
6 | 22130221211545 |
7 | 2145532160000 |
oct | 347107665271 |
9 | 88061440622 |
10 | 31023131321 |
11 | 1217a826806 |
12 | 6019700bb5 |
13 | 2c05340a50 |
14 | 1704297c37 |
15 | c18878d9b |
hex | 7391f6ab9 |
31023131321 has 40 divisors (see below), whose sum is σ = 40320619080. Its totient is φ = 23698676736.
The previous prime is 31023131311. The next prime is 31023131323. The reversal of 31023131321 is 12313132013.
It can be written as a sum of positive squares in 4 ways, for example, as 5880589225 + 25142542096 = 76685^2 + 158564^2 .
It is not a de Polignac number, because 31023131321 - 26 = 31023131257 is a prime.
It is a super-2 number, since 2×310231313212 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31023131293 and 31023131302.
It is not an unprimeable number, because it can be changed into a prime (31023131323) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 888041 + ... + 922313.
It is an arithmetic number, because the mean of its divisors is an integer number (1008015477).
Almost surely, 231023131321 is an apocalyptic number.
It is an amenable number.
31023131321 is a deficient number, since it is larger than the sum of its proper divisors (9297487759).
31023131321 is an equidigital number, since it uses as much as digits as its factorization.
31023131321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34343 (or 34322 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 31023131321 its reverse (12313132013), we get a palindrome (43336263334).
The spelling of 31023131321 in words is "thirty-one billion, twenty-three million, one hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •