Base | Representation |
---|---|
bin | 10000010110000100001… |
… | …100000111000010100101 |
3 | 10222101012000220212001001 |
4 | 100112010030013002211 |
5 | 121400310240400313 |
6 | 2215554244433301 |
7 | 144102022303522 |
oct | 20260414070245 |
9 | 3871160825031 |
10 | 1123204231333 |
11 | 3a3391563488 |
12 | 1618269a8831 |
13 | 81bc1273682 |
14 | 3c51315a149 |
15 | 1e33cba3add |
hex | 105843070a5 |
1123204231333 has 2 divisors, whose sum is σ = 1123204231334. Its totient is φ = 1123204231332.
The previous prime is 1123204231319. The next prime is 1123204231361. The reversal of 1123204231333 is 3331324023211.
It is an a-pointer prime, because the next prime (1123204231361) can be obtained adding 1123204231333 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1122173692929 + 1030538404 = 1059327^2 + 32102^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123204231333 - 25 = 1123204231301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1123204231313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561602115666 + 561602115667.
It is an arithmetic number, because the mean of its divisors is an integer number (561602115667).
Almost surely, 21123204231333 is an apocalyptic number.
It is an amenable number.
1123204231333 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123204231333 is an equidigital number, since it uses as much as digits as its factorization.
1123204231333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 1123204231333 its reverse (3331324023211), we get a palindrome (4454528254544).
The spelling of 1123204231333 in words is "one trillion, one hundred twenty-three billion, two hundred four million, two hundred thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •