Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …000101000100011010001 |
3 | 10220021101112002010221212 |
4 | 100001210220220203101 |
5 | 121020224200014413 |
6 | 2201515001425505 |
7 | 142362522366263 |
oct | 20014450504321 |
9 | 3807345063855 |
10 | 1101200001233 |
11 | 39501a768752 |
12 | 15950579b295 |
13 | 7cac55a0187 |
14 | 3b4269d7b33 |
15 | 1d9a0edbca8 |
hex | 10064a288d1 |
1101200001233 has 2 divisors, whose sum is σ = 1101200001234. Its totient is φ = 1101200001232.
The previous prime is 1101200001217. The next prime is 1101200001263. The reversal of 1101200001233 is 3321000021011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 843656946064 + 257543055169 = 918508^2 + 507487^2 .
It is an emirp because it is prime and its reverse (3321000021011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101200001233 - 24 = 1101200001217 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101200001263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550600000616 + 550600000617.
It is an arithmetic number, because the mean of its divisors is an integer number (550600000617).
Almost surely, 21101200001233 is an apocalyptic number.
It is an amenable number.
1101200001233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101200001233 is an equidigital number, since it uses as much as digits as its factorization.
1101200001233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1101200001233 its reverse (3321000021011), we get a palindrome (4422200022244).
The spelling of 1101200001233 in words is "one trillion, one hundred one billion, two hundred million, one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •