Base | Representation |
---|---|
bin | 1010000000111000010001… |
… | …1011111101010100110001 |
3 | 1102222120022101020000210102 |
4 | 2200032010123331110301 |
5 | 2420342414103214413 |
6 | 35230005432042145 |
7 | 2214314410126226 |
oct | 240160433752461 |
9 | 42876271200712 |
10 | 11010223101233 |
11 | 35654559a5204 |
12 | 1299a31533355 |
13 | 61b34b3c6695 |
14 | 2a0c7d1b194d |
15 | 141603e36458 |
hex | a03846fd531 |
11010223101233 has 2 divisors, whose sum is σ = 11010223101234. Its totient is φ = 11010223101232.
The previous prime is 11010223101217. The next prime is 11010223101263. The reversal of 11010223101233 is 33210132201011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10943611620769 + 66611480464 = 3308113^2 + 258092^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010223101233 - 24 = 11010223101217 is a prime.
It is a super-2 number, since 2×110102231012332 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11010223101203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505111550616 + 5505111550617.
It is an arithmetic number, because the mean of its divisors is an integer number (5505111550617).
Almost surely, 211010223101233 is an apocalyptic number.
It is an amenable number.
11010223101233 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010223101233 is an equidigital number, since it uses as much as digits as its factorization.
11010223101233 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 11010223101233 its reverse (33210132201011), we get a palindrome (44220355302244).
The spelling of 11010223101233 in words is "eleven trillion, ten billion, two hundred twenty-three million, one hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •