Base | Representation |
---|---|
bin | 1110000110100100100011… |
… | …10100010111010001000111 |
3 | 11001210201200021210011210100 |
4 | 13003102101310113101013 |
5 | 13031100300214101411 |
6 | 145542433343255143 |
7 | 6350360001114054 |
oct | 703222164272107 |
9 | 131721607704710 |
10 | 31012110300231 |
11 | 9977186864835 |
12 | 358a430baa4b3 |
13 | 143c57767b4c8 |
14 | 792dcbd2402b |
15 | 38ba697ec456 |
hex | 1c3491d17447 |
31012110300231 has 24 divisors (see below), whose sum is σ = 44848262978064. Its totient is φ = 20650295727360.
The previous prime is 31012110300173. The next prime is 31012110300247. The reversal of 31012110300231 is 13200301121013.
31012110300231 is a `hidden beast` number, since 3 + 1 + 0 + 121 + 10 + 300 + 231 = 666.
It is not a de Polignac number, because 31012110300231 - 29 = 31012110299719 is a prime.
It is a super-2 number, since 2×310121103002312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31012110350231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26835120 + ... + 27966906.
It is an arithmetic number, because the mean of its divisors is an integer number (1868677624086).
Almost surely, 231012110300231 is an apocalyptic number.
31012110300231 is a deficient number, since it is larger than the sum of its proper divisors (13836152677833).
31012110300231 is a wasteful number, since it uses less digits than its factorization.
31012110300231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1135391 (or 1135388 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 31012110300231 its reverse (13200301121013), we get a palindrome (44212411421244).
The spelling of 31012110300231 in words is "thirty-one trillion, twelve billion, one hundred ten million, three hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •