Base | Representation |
---|---|
bin | 11110000000110010001… |
… | …10101010111100110111 |
3 | 10122120202000210220000212 |
4 | 33000121012222330313 |
5 | 113343411103031411 |
6 | 2105422144300035 |
7 | 134334266452550 |
oct | 17003106527467 |
9 | 3576660726025 |
10 | 1031213330231 |
11 | 36837604a987 |
12 | 147a3331161b |
13 | 76320b41706 |
14 | 37ca7a91327 |
15 | 1bc56b6068b |
hex | f0191aaf37 |
1031213330231 has 16 divisors (see below), whose sum is σ = 1180163174400. Its totient is φ = 882672318528.
The previous prime is 1031213330153. The next prime is 1031213330233. The reversal of 1031213330231 is 1320333121301.
It is not a de Polignac number, because 1031213330231 - 210 = 1031213329207 is a prime.
It is a super-3 number, since 3×10312133302313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1031213330197 and 1031213330206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031213330233) 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, 37156346 + ... + 37184088.
It is an arithmetic number, because the mean of its divisors is an integer number (73760198400).
Almost surely, 21031213330231 is an apocalyptic number.
1031213330231 is a deficient number, since it is larger than the sum of its proper divisors (148949844169).
1031213330231 is an equidigital number, since it uses as much as digits as its factorization.
1031213330231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34918.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1031213330231 its reverse (1320333121301), we get a palindrome (2351546451532).
The spelling of 1031213330231 in words is "one trillion, thirty-one billion, two hundred thirteen million, three hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •