Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0111000011101101100111 |
3 | 1111010020122002022211121012 |
4 | 2210320330013003231213 |
5 | 2441122124321210043 |
6 | 40033241132012435 |
7 | 2246435006422463 |
oct | 244707407035547 |
9 | 44106562284535 |
10 | 11331132210023 |
11 | 36795628043aa |
12 | 133007130111b |
13 | 6426a10655c2 |
14 | 2b26032474a3 |
15 | 149b3708ba18 |
hex | a4e3c1c3b67 |
11331132210023 has 16 divisors (see below), whose sum is σ = 11682079355520. Its totient is φ = 10986532794336.
The previous prime is 11331132210017. The next prime is 11331132210053. The reversal of 11331132210023 is 32001223113311.
It is not a de Polignac number, because 11331132210023 - 24 = 11331132210007 is a prime.
It is a super-2 number, since 2×113311322100232 (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 (11331132210053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2291465 + ... + 5283282.
It is an arithmetic number, because the mean of its divisors is an integer number (730129959720).
Almost surely, 211331132210023 is an apocalyptic number.
11331132210023 is a deficient number, since it is larger than the sum of its proper divisors (350947145497).
11331132210023 is an equidigital number, since it uses as much as digits as its factorization.
11331132210023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7575166.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11331132210023 its reverse (32001223113311), we get a palindrome (43332355323334).
The spelling of 11331132210023 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •