Base | Representation |
---|---|
bin | 10001011101110010110… |
… | …111110010000001011111 |
3 | 11020201222121111211001022 |
4 | 101131302313302001133 |
5 | 124131024103213043 |
6 | 2315212550234355 |
7 | 152466435013232 |
oct | 21356267620137 |
9 | 4221877454038 |
10 | 1200223101023 |
11 | 423014718201 |
12 | 1747403559bb |
13 | 8924689ca4b |
14 | 4213c001419 |
15 | 213495a9868 |
hex | 11772df205f |
1200223101023 has 2 divisors, whose sum is σ = 1200223101024. Its totient is φ = 1200223101022.
The previous prime is 1200223101017. The next prime is 1200223101029. The reversal of 1200223101023 is 3201013220021.
It is a balanced prime because it is at equal distance from previous prime (1200223101017) and next prime (1200223101029).
It is a cyclic number.
It is not a de Polignac number, because 1200223101023 - 28 = 1200223100767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1200223100992 and 1200223101010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1200223101029) 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, 600111550511 + 600111550512.
It is an arithmetic number, because the mean of its divisors is an integer number (600111550512).
Almost surely, 21200223101023 is an apocalyptic number.
1200223101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200223101023 is an equidigital number, since it uses as much as digits as its factorization.
1200223101023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1200223101023 its reverse (3201013220021), we get a palindrome (4401236321044).
The spelling of 1200223101023 in words is "one trillion, two hundred billion, two hundred twenty-three million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •