Base | Representation |
---|---|
bin | 1010010011100011101111… |
… | …1111110011111001000101 |
3 | 1111010020121221202022112212 |
4 | 2210320323333303321011 |
5 | 2441122123324411323 |
6 | 40033241023153205 |
7 | 2246434654320620 |
oct | 244707377637105 |
9 | 44106557668485 |
10 | 11331130310213 |
11 | 367956172700a |
12 | 1330070745805 |
13 | 6426a084b95c |
14 | 2b2602cb0db7 |
15 | 149b36d13b78 |
hex | a4e3bff3e45 |
11331130310213 has 8 divisors (see below), whose sum is σ = 12949885776960. Its totient is φ = 9712380484800.
The previous prime is 11331130310191. The next prime is 11331130310263. The reversal of 11331130310213 is 31201303113311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11331130310213 - 222 = 11331126115909 is a prime.
It is a super-2 number, since 2×113311303102132 (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 (11331130310263) 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, 4603238 + ... + 6622088.
It is an arithmetic number, because the mean of its divisors is an integer number (1618735722120).
Almost surely, 211331130310213 is an apocalyptic number.
It is an amenable number.
11331130310213 is a deficient number, since it is larger than the sum of its proper divisors (1618755466747).
11331130310213 is an equidigital number, since it uses as much as digits as its factorization.
11331130310213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2820667.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 11331130310213 its reverse (31201303113311), we get a palindrome (42532433423524).
The spelling of 11331130310213 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •