Base | Representation |
---|---|
bin | 1010010011100011010100… |
… | …0000110011011100110001 |
3 | 1111010020022210020221120012 |
4 | 2210320311000303130301 |
5 | 2441121403330130113 |
6 | 40033221235424305 |
7 | 2246432032312502 |
oct | 244706500633461 |
9 | 44106283227505 |
10 | 11331013130033 |
11 | 3679501570893 |
12 | 1330039455095 |
13 | 6426824a137c |
14 | 2b25d14caba9 |
15 | 149b2b8b8aa8 |
hex | a4e35033731 |
11331013130033 has 8 divisors (see below), whose sum is σ = 12249743925120. Its totient is φ = 10444518503280.
The previous prime is 11331013129987. The next prime is 11331013130093. The reversal of 11331013130033 is 33003131013311.
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 11331013130033 - 214 = 11331013113649 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11331013129990 and 11331013130008.
It is not an unprimeable number, because it can be changed into a prime (11331013130093) 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, 8059041353 + ... + 8059042758.
It is an arithmetic number, because the mean of its divisors is an integer number (1531217990640).
Almost surely, 211331013130033 is an apocalyptic number.
It is an amenable number.
11331013130033 is a deficient number, since it is larger than the sum of its proper divisors (918730795087).
11331013130033 is a wasteful number, since it uses less digits than its factorization.
11331013130033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16118084167.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 11331013130033 its reverse (33003131013311), we get a palindrome (44334144143344).
The spelling of 11331013130033 in words is "eleven trillion, three hundred thirty-one billion, thirteen million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •