Base | Representation |
---|---|
bin | 1010000010000110100010… |
… | …0011110011101010001111 |
3 | 1110001120112101211220102021 |
4 | 2200201220203303222033 |
5 | 2421213424414430411 |
6 | 35243402135511011 |
7 | 2215660111610065 |
oct | 240415043635217 |
9 | 43046471756367 |
10 | 11031230233231 |
11 | 357335597941a |
12 | 12a1b14828467 |
13 | 6203186377c0 |
14 | 2a1cb3140035 |
15 | 141e332e1a71 |
hex | a08688f3a8f |
11031230233231 has 16 divisors (see below), whose sum is σ = 12004387857504. Its totient is φ = 10075910068224.
The previous prime is 11031230233213. The next prime is 11031230233273. The reversal of 11031230233231 is 13233203213011.
It is not a de Polignac number, because 11031230233231 - 211 = 11031230231183 is a prime.
It is a super-2 number, since 2×110312302332312 (a number of 27 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 = 11031230233196 and 11031230233205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11031230233931) 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, 6360276 + ... + 7906678.
It is an arithmetic number, because the mean of its divisors is an integer number (750274241094).
Almost surely, 211031230233231 is an apocalyptic number.
11031230233231 is a deficient number, since it is larger than the sum of its proper divisors (973157624273).
11031230233231 is a wasteful number, since it uses less digits than its factorization.
11031230233231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1552170.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 11031230233231 its reverse (13233203213011), we get a palindrome (24264433446242).
The spelling of 11031230233231 in words is "eleven trillion, thirty-one billion, two hundred thirty million, two hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •