Base | Representation |
---|---|
bin | 10001101000000001001… |
… | …001010101011111100111 |
3 | 11021210022121111011102012 |
4 | 101220001021111133213 |
5 | 124321014200031043 |
6 | 2324230111304435 |
7 | 153335444102114 |
oct | 21500111253747 |
9 | 4253277434365 |
10 | 1211200002023 |
11 | 427737909410 |
12 | 1768a451b11b |
13 | 8a2a5a9a53b |
14 | 4289dbbb90b |
15 | 2178d0d4a18 |
hex | 11a012557e7 |
1211200002023 has 16 divisors (see below), whose sum is σ = 1363333676544. Its totient is φ = 1066553468160.
The previous prime is 1211200002007. The next prime is 1211200002037. The reversal of 1211200002023 is 3202000021121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1211200002023 - 24 = 1211200002007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1211200001989 and 1211200002007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211200002053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12025865 + ... + 12126162.
It is an arithmetic number, because the mean of its divisors is an integer number (85208354784).
Almost surely, 21211200002023 is an apocalyptic number.
1211200002023 is a deficient number, since it is larger than the sum of its proper divisors (152133674521).
1211200002023 is a wasteful number, since it uses less digits than its factorization.
1211200002023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24152182.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1211200002023 its reverse (3202000021121), we get a palindrome (4413200023144).
The spelling of 1211200002023 in words is "one trillion, two hundred eleven billion, two hundred million, two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •