Base | Representation |
---|---|
bin | 1010010011100011101001… |
… | …0011110111001001110111 |
3 | 1111010020112222111121201202 |
4 | 2210320322103313021313 |
5 | 2441122044103341043 |
6 | 40033234132443115 |
7 | 2246434161640613 |
oct | 244707223671167 |
9 | 44106488447652 |
10 | 11331102012023 |
11 | 3679547759182 |
12 | 133006317949b |
13 | 642697a21471 |
14 | 2b25dd226343 |
15 | 149b345c41b8 |
hex | a4e3a4f7277 |
11331102012023 has 8 divisors (see below), whose sum is σ = 11734753432080. Its totient is φ = 10928312176320.
The previous prime is 11331102012019. The next prime is 11331102012031. The reversal of 11331102012023 is 32021020113311.
It is a happy number.
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 11331102012023 - 22 = 11331102012019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11331102011986 and 11331102012004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331102012073) 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, 215369318 + ... + 215421923.
It is an arithmetic number, because the mean of its divisors is an integer number (1466844179010).
Almost surely, 211331102012023 is an apocalyptic number.
11331102012023 is a deficient number, since it is larger than the sum of its proper divisors (403651420057).
11331102012023 is an equidigital number, since it uses as much as digits as its factorization.
11331102012023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430792177.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11331102012023 its reverse (32021020113311), we get a palindrome (43352122125334).
The spelling of 11331102012023 in words is "eleven trillion, three hundred thirty-one billion, one hundred two million, twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •