Base | Representation |
---|---|
bin | 1010010010111010010100… |
… | …1100011101100001000111 |
3 | 1111002011220222112220110111 |
4 | 2210232211030131201013 |
5 | 2440431340121112411 |
6 | 40024201351333451 |
7 | 2245562260135006 |
oct | 244564514354107 |
9 | 44064828486414 |
10 | 11320010332231 |
11 | 36748757a1a67 |
12 | 1329a88681287 |
13 | 64161ab07423 |
14 | 2b1c6a0ccc3d |
15 | 1496d5975721 |
hex | a4ba531d847 |
11320010332231 has 8 divisors (see below), whose sum is σ = 11515136504960. Its totient is φ = 11125653888888.
The previous prime is 11320010332193. The next prime is 11320010332237. The reversal of 11320010332231 is 13223301002311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11320010332231 - 29 = 11320010331719 is a prime.
It is a super-2 number, since 2×113200103322312 (a number of 27 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 (11320010332237) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192402681 + ... + 192461506.
It is an arithmetic number, because the mean of its divisors is an integer number (1439392063120).
Almost surely, 211320010332231 is an apocalyptic number.
11320010332231 is a deficient number, since it is larger than the sum of its proper divisors (195126172729).
11320010332231 is an equidigital number, since it uses as much as digits as its factorization.
11320010332231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384864693.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11320010332231 its reverse (13223301002311), we get a palindrome (24543311334542).
The spelling of 11320010332231 in words is "eleven trillion, three hundred twenty billion, ten million, three hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •