Base | Representation |
---|---|
bin | 1110001101000000000001… |
… | …01110010111001101110111 |
3 | 11002120211212110200121120002 |
4 | 13012200000232113031313 |
5 | 13043210203132031411 |
6 | 150232125415301515 |
7 | 6402340132310000 |
oct | 706400056271567 |
9 | 132524773617502 |
10 | 31233014330231 |
11 | 9a5193538a08a |
12 | 360520137a89b |
13 | 14573507500ac |
14 | 79d9863b61a7 |
15 | 39269806333b |
hex | 1c6800b97377 |
31233014330231 has 10 divisors (see below), whose sum is σ = 36436348665432. Its totient is φ = 26771155138140.
The previous prime is 31233014330201. The next prime is 31233014330249. The reversal of 31233014330231 is 13203341033213.
It is a de Polignac number, because none of the positive numbers 2k-31233014330231 is a prime.
It is a super-2 number, since 2×312330143302312 (a number of 28 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 = 31233014330194 and 31233014330203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31233014330201) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6504165515 + ... + 6504170316.
Almost surely, 231233014330231 is an apocalyptic number.
31233014330231 is a deficient number, since it is larger than the sum of its proper divisors (5203334335201).
31233014330231 is an frugal number, since it uses more digits than its factorization.
31233014330231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13008335859 (or 13008335838 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 31233014330231 its reverse (13203341033213), we get a palindrome (44436355363444).
The spelling of 31233014330231 in words is "thirty-one trillion, two hundred thirty-three billion, fourteen million, three hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •