Base | Representation |
---|---|
bin | 1010010011100100011101… |
… | …0111010100101001010111 |
3 | 1111010021010020121112101202 |
4 | 2210321013113110221113 |
5 | 2441123021140214223 |
6 | 40033311554543115 |
7 | 2246442461335016 |
oct | 244710727245127 |
9 | 44107106545352 |
10 | 11331321023063 |
11 | 367964a346438 |
12 | 1330104597a9b |
13 | 6427012039b2 |
14 | 2b2620356a7d |
15 | 149b48936428 |
hex | a4e475d4a57 |
11331321023063 has 2 divisors, whose sum is σ = 11331321023064. Its totient is φ = 11331321023062.
The previous prime is 11331321023027. The next prime is 11331321023147. The reversal of 11331321023063 is 36032012313311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11331321023063 - 220 = 11331319974487 is a prime.
It is a super-3 number, since 3×113313210230633 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331320023063) 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 as a sum of consecutive naturals, namely, 5665660511531 + 5665660511532.
It is an arithmetic number, because the mean of its divisors is an integer number (5665660511532).
Almost surely, 211331321023063 is an apocalyptic number.
11331321023063 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331321023063 is an equidigital number, since it uses as much as digits as its factorization.
11331321023063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 11331321023063 its reverse (36032012313311), we get a palindrome (47363333336374).
The spelling of 11331321023063 in words is "eleven trillion, three hundred thirty-one billion, three hundred twenty-one million, twenty-three thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •