Base | Representation |
---|---|
bin | 1110001111010101100111… |
… | …00011100001010111101111 |
3 | 11002212112011101112121202002 |
4 | 13013222303203201113233 |
5 | 13101014141422134411 |
6 | 150333050434522515 |
7 | 6411212234362550 |
oct | 707526343412757 |
9 | 132775141477662 |
10 | 31313324021231 |
11 | 9a829a708963a |
12 | 3618894a3643b |
13 | 1461aaba96a05 |
14 | 7a3804328327 |
15 | 3947e880733b |
hex | 1c7ab38e15ef |
31313324021231 has 16 divisors (see below), whose sum is σ = 38457302006016. Its totient is φ = 24884136579456.
The previous prime is 31313324021209. The next prime is 31313324021267. The reversal of 31313324021231 is 13212042331313.
It is not a de Polignac number, because 31313324021231 - 26 = 31313324021167 is a prime.
It is a super-2 number, since 2×313133240212312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31313324021194 and 31313324021203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31313324021131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1963702301 + ... + 1963718246.
It is an arithmetic number, because the mean of its divisors is an integer number (2403581375376).
Almost surely, 231313324021231 is an apocalyptic number.
31313324021231 is a deficient number, since it is larger than the sum of its proper divisors (7143977984785).
31313324021231 is a wasteful number, since it uses less digits than its factorization.
31313324021231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3927420638.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 31313324021231 its reverse (13212042331313), we get a palindrome (44525366352544).
The spelling of 31313324021231 in words is "thirty-one trillion, three hundred thirteen billion, three hundred twenty-four million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •