Base | Representation |
---|---|
bin | 11101001110100010101… |
… | …11111110001011100001 |
3 | 10120000010012220221010001 |
4 | 32213101113332023201 |
5 | 112423140431231423 |
6 | 2045201434340001 |
7 | 132361002011533 |
oct | 16472127761341 |
9 | 3500105827101 |
10 | 1004240102113 |
11 | 3579943a2416 |
12 | 142765b8a601 |
13 | 739128756c1 |
14 | 3686961b853 |
15 | 1b1c8b17cad |
hex | e9d15fe2e1 |
1004240102113 has 2 divisors, whose sum is σ = 1004240102114. Its totient is φ = 1004240102112.
The previous prime is 1004240102053. The next prime is 1004240102143. The reversal of 1004240102113 is 3112010424001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 992278961424 + 11961140689 = 996132^2 + 109367^2 .
It is an emirp because it is prime and its reverse (3112010424001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1004240102113 - 237 = 866801148641 is a prime.
It is not a weakly prime, because it can be changed into another prime (1004240102143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502120051056 + 502120051057.
It is an arithmetic number, because the mean of its divisors is an integer number (502120051057).
Almost surely, 21004240102113 is an apocalyptic number.
It is an amenable number.
1004240102113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1004240102113 is an equidigital number, since it uses as much as digits as its factorization.
1004240102113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 1004240102113 its reverse (3112010424001), we get a palindrome (4116250526114).
The spelling of 1004240102113 in words is "one trillion, four billion, two hundred forty million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •