Base | Representation |
---|---|
bin | 10001101000000111001… |
… | …011011010100001101111 |
3 | 11021210120122221001222001 |
4 | 101220013023122201233 |
5 | 124321221102211343 |
6 | 2324244124433131 |
7 | 153341113255546 |
oct | 21500713324157 |
9 | 4253518831861 |
10 | 1211301210223 |
11 | 427789a55655 |
12 | 1769123a87a7 |
13 | 8a2c0a44c50 |
14 | 428ad40515d |
15 | 21796e2744d |
hex | 11a072da86f |
1211301210223 has 16 divisors (see below), whose sum is σ = 1311454674432. Its totient is φ = 1112145696000.
The previous prime is 1211301210157. The next prime is 1211301210269. The reversal of 1211301210223 is 3220121031121.
It is a cyclic number.
It is not a de Polignac number, because 1211301210223 - 213 = 1211301202031 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1211301210223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211301210293) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27939403 + ... + 27982723.
It is an arithmetic number, because the mean of its divisors is an integer number (81965917152).
Almost surely, 21211301210223 is an apocalyptic number.
1211301210223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1211301210223 is a deficient number, since it is larger than the sum of its proper divisors (100153464209).
1211301210223 is a wasteful number, since it uses less digits than its factorization.
1211301210223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54786.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1211301210223 its reverse (3220121031121), we get a palindrome (4431422241344).
The spelling of 1211301210223 in words is "one trillion, two hundred eleven billion, three hundred one million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •