Base | Representation |
---|---|
bin | 11101011011100000011… |
… | …10101000110101001101 |
3 | 10120200002021120112111202 |
4 | 32231300032220311031 |
5 | 113031414222400023 |
6 | 2052312225355245 |
7 | 133025324611253 |
oct | 16556016506515 |
9 | 3520067515452 |
10 | 1011200200013 |
11 | 35a936172a43 |
12 | 143b88a98b25 |
13 | 7448181a523 |
14 | 36d29b4c5d3 |
15 | 1b484b9e128 |
hex | eb703a8d4d |
1011200200013 has 4 divisors (see below), whose sum is σ = 1020650669280. Its totient is φ = 1001749730748.
The previous prime is 1011200200007. The next prime is 1011200200057. The reversal of 1011200200013 is 3100020021101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1011200200013 - 220 = 1011199151437 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011200199967 and 1011200200003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011200209013) 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, 4725234473 + ... + 4725234686.
It is an arithmetic number, because the mean of its divisors is an integer number (255162667320).
Almost surely, 21011200200013 is an apocalyptic number.
It is an amenable number.
1011200200013 is a deficient number, since it is larger than the sum of its proper divisors (9450469267).
1011200200013 is an equidigital number, since it uses as much as digits as its factorization.
1011200200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9450469266.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1011200200013 its reverse (3100020021101), we get a palindrome (4111220221114).
The spelling of 1011200200013 in words is "one trillion, eleven billion, two hundred million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •