Base | Representation |
---|---|
bin | 1010010011100011010101… |
… | …1110110111110000110111 |
3 | 1111010020100100002101121202 |
4 | 2210320311132313300313 |
5 | 2441121412334341043 |
6 | 40033222120403115 |
7 | 2246432156311166 |
oct | 244706536676067 |
9 | 44106310071552 |
10 | 11331021012023 |
11 | 3679505a64729 |
12 | 133004001649b |
13 | 642684000b7b |
14 | 2b25d257d3dd |
15 | 149b2c4241b8 |
hex | a4e357b7c37 |
11331021012023 has 2 divisors, whose sum is σ = 11331021012024. Its totient is φ = 11331021012022.
The previous prime is 11331021012019. The next prime is 11331021012029. The reversal of 11331021012023 is 32021012013311.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11331021012023 - 22 = 11331021012019 is a prime.
It is a super-2 number, since 2×113310210120232 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 11331021011986 and 11331021012004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331021012029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665510506011 + 5665510506012.
It is an arithmetic number, because the mean of its divisors is an integer number (5665510506012).
Almost surely, 211331021012023 is an apocalyptic number.
11331021012023 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331021012023 is an equidigital number, since it uses as much as digits as its factorization.
11331021012023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11331021012023 its reverse (32021012013311), we get a palindrome (43352033025334).
The spelling of 11331021012023 in words is "eleven trillion, three hundred thirty-one billion, twenty-one million, twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •