Base | Representation |
---|---|
bin | 11100111000111100… |
… | …011000010001011111 |
3 | 2222001211211112101000 |
4 | 130320330120101133 |
5 | 1002012122420411 |
6 | 22130032521343 |
7 | 2145464461026 |
oct | 347074302137 |
9 | 88054745330 |
10 | 31020123231 |
11 | 12179061789 |
12 | 60186b0253 |
13 | 2c04829806 |
14 | 1703b138bd |
15 | c18482956 |
hex | 738f1845f |
31020123231 has 8 divisors (see below), whose sum is σ = 45955738160. Its totient is φ = 20680082136.
The previous prime is 31020123191. The next prime is 31020123241. The reversal of 31020123231 is 13232102013.
31020123231 is a `hidden beast` number, since 310 + 2 + 0 + 123 + 231 = 666.
It is not a de Polignac number, because 31020123231 - 27 = 31020123103 is a prime.
It is a super-2 number, since 2×310201232312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31020123241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 574446700 + ... + 574446753.
It is an arithmetic number, because the mean of its divisors is an integer number (5744467270).
Almost surely, 231020123231 is an apocalyptic number.
31020123231 is a deficient number, since it is larger than the sum of its proper divisors (14935614929).
31020123231 is a wasteful number, since it uses less digits than its factorization.
31020123231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1148893462 (or 1148893456 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 31020123231 its reverse (13232102013), we get a palindrome (44252225244).
The spelling of 31020123231 in words is "thirty-one billion, twenty million, one hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •