Base | Representation |
---|---|
bin | 1110001100111010101001… |
… | …11011001001100101010111 |
3 | 11002120120102121002010022201 |
4 | 13012131110323021211113 |
5 | 13043133302243013421 |
6 | 150230531413105331 |
7 | 6402205533025051 |
oct | 706352473114527 |
9 | 132516377063281 |
10 | 31230132001111 |
11 | 9a5069638a5aa |
12 | 3604738028247 |
13 | 1456cb15585c4 |
14 | 79d7916808d1 |
15 | 392579eb4b91 |
hex | 1c6754ec9957 |
31230132001111 has 4 divisors (see below), whose sum is σ = 31387067338000. Its totient is φ = 31073196664224.
The previous prime is 31230132001091. The next prime is 31230132001129. The reversal of 31230132001111 is 11110023103213.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31230132001111 - 237 = 31092693047639 is a prime.
It is a super-2 number, since 2×312301320011112 (a number of 28 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 (31230132001141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78467668146 + ... + 78467668543.
It is an arithmetic number, because the mean of its divisors is an integer number (7846766834500).
Almost surely, 231230132001111 is an apocalyptic number.
31230132001111 is a deficient number, since it is larger than the sum of its proper divisors (156935336889).
31230132001111 is a wasteful number, since it uses less digits than its factorization.
31230132001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156935336888.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 31230132001111 its reverse (11110023103213), we get a palindrome (42340155104324).
The spelling of 31230132001111 in words is "thirty-one trillion, two hundred thirty billion, one hundred thirty-two million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •