Base | Representation |
---|---|
bin | 11101001000100000101… |
… | …00100011000110101101 |
3 | 10112200202111100202120001 |
4 | 32210100110203012231 |
5 | 112400022301431333 |
6 | 2043504213424301 |
7 | 132214512554404 |
oct | 16442024430655 |
9 | 3480674322501 |
10 | 1001001202093 |
11 | 35658209a942 |
12 | 14200133b091 |
13 | 73517836c09 |
14 | 3663d3c863b |
15 | 1b0895d3b7d |
hex | e9105231ad |
1001001202093 has 2 divisors, whose sum is σ = 1001001202094. Its totient is φ = 1001001202092.
The previous prime is 1001001202087. The next prime is 1001001202139. The reversal of 1001001202093 is 3902021001001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 529056933769 + 471944268324 = 727363^2 + 686982^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001001202093 - 213 = 1001001193901 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1001001202093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001001242093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500500601046 + 500500601047.
It is an arithmetic number, because the mean of its divisors is an integer number (500500601047).
Almost surely, 21001001202093 is an apocalyptic number.
It is an amenable number.
1001001202093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001001202093 is an equidigital number, since it uses as much as digits as its factorization.
1001001202093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1001001202093 its reverse (3902021001001), we get a palindrome (4903022203094).
The spelling of 1001001202093 in words is "one trillion, one billion, one million, two hundred two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •