Base | Representation |
---|---|
bin | 1010010010011100111001… |
… | …1011111100101010100001 |
3 | 1111001102112120001110220201 |
4 | 2210213032123330222201 |
5 | 2440314201223320413 |
6 | 40020413533505201 |
7 | 2245162455151501 |
oct | 244471633745241 |
9 | 44042476043821 |
10 | 11312112323233 |
11 | 36714925559a7 |
12 | 1328443642201 |
13 | 64095c754117 |
14 | 2b171b1b3a01 |
15 | 1493c23c49dd |
hex | a49ce6fcaa1 |
11312112323233 has 2 divisors, whose sum is σ = 11312112323234. Its totient is φ = 11312112323232.
The previous prime is 11312112323221. The next prime is 11312112323243. The reversal of 11312112323233 is 33232321121311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10227415069089 + 1084697254144 = 3198033^2 + 1041488^2 .
It is a cyclic number.
It is not a de Polignac number, because 11312112323233 - 241 = 9113089067681 is a prime.
It is not a weakly prime, because it can be changed into another prime (11312112323243) 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, 5656056161616 + 5656056161617.
It is an arithmetic number, because the mean of its divisors is an integer number (5656056161617).
Almost surely, 211312112323233 is an apocalyptic number.
It is an amenable number.
11312112323233 is a deficient number, since it is larger than the sum of its proper divisors (1).
11312112323233 is an equidigital number, since it uses as much as digits as its factorization.
11312112323233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3888, while the sum is 28.
Adding to 11312112323233 its reverse (33232321121311), we get a palindrome (44544433444544).
The spelling of 11312112323233 in words is "eleven trillion, three hundred twelve billion, one hundred twelve million, three hundred twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •