Base | Representation |
---|---|
bin | 10001101000000001111… |
… | …010111011010111100101 |
3 | 11021210100111221122022201 |
4 | 101220001322323113211 |
5 | 124321031012032323 |
6 | 2324231254054501 |
7 | 153335662435414 |
oct | 21500172732745 |
9 | 4253314848281 |
10 | 1211213002213 |
11 | 427744188675 |
12 | 1768a894a431 |
13 | 8a2a869c866 |
14 | 428a180347b |
15 | 2178e3018ad |
hex | 11a01ebb5e5 |
1211213002213 has 4 divisors (see below), whose sum is σ = 1212505653100. Its totient is φ = 1209920351328.
The previous prime is 1211213002211. The next prime is 1211213002247. The reversal of 1211213002213 is 3122003121121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 222815153089 + 988397849124 = 472033^2 + 994182^2 .
It is a cyclic number.
It is not a de Polignac number, because 1211213002213 - 21 = 1211213002211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211213002211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 646324038 + ... + 646325911.
It is an arithmetic number, because the mean of its divisors is an integer number (303126413275).
Almost surely, 21211213002213 is an apocalyptic number.
It is an amenable number.
1211213002213 is a deficient number, since it is larger than the sum of its proper divisors (1292650887).
1211213002213 is an equidigital number, since it uses as much as digits as its factorization.
1211213002213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1292650886.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1211213002213 its reverse (3122003121121), we get a palindrome (4333216123334).
The spelling of 1211213002213 in words is "one trillion, two hundred eleven billion, two hundred thirteen million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •