Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …111011000101011111001 |
3 | 10220011022001012112222211 |
4 | 100000131033120223321 |
5 | 121010301030402223 |
6 | 2201200052415121 |
7 | 142321036300312 |
oct | 20003517305371 |
9 | 3804261175884 |
10 | 1100002200313 |
11 | 394565624135 |
12 | 1592306174a1 |
13 | 7c964398933 |
14 | 3b3518bb609 |
15 | 1d930c87d0d |
hex | 1001d3d8af9 |
1100002200313 has 2 divisors, whose sum is σ = 1100002200314. Its totient is φ = 1100002200312.
The previous prime is 1100002200301. The next prime is 1100002200431. The reversal of 1100002200313 is 3130022000011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 576850883049 + 523151317264 = 759507^2 + 723292^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100002200313 - 25 = 1100002200281 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100002200293 and 1100002200302.
It is not a weakly prime, because it can be changed into another prime (1100002210313) 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 as a sum of consecutive naturals, namely, 550001100156 + 550001100157.
It is an arithmetic number, because the mean of its divisors is an integer number (550001100157).
Almost surely, 21100002200313 is an apocalyptic number.
It is an amenable number.
1100002200313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100002200313 is an equidigital number, since it uses as much as digits as its factorization.
1100002200313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 1100002200313 its reverse (3130022000011), we get a palindrome (4230024200324).
The spelling of 1100002200313 in words is "one trillion, one hundred billion, two million, two hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •