Base | Representation |
---|---|
bin | 10111101001100100101110… |
… | …100011101100000001000111 |
3 | 111122021110011101212102121022 |
4 | 113221210232203230001013 |
5 | 102113113041023131003 |
6 | 1005114242142341355 |
7 | 30623422265346632 |
oct | 2751445643540107 |
9 | 448243141772538 |
10 | 104012004114503 |
11 | 3016127480a731 |
12 | b7ba28188a85b |
13 | 460639cbb6bc4 |
14 | 1b982ca520c19 |
15 | c058ce55e738 |
hex | 5e992e8ec047 |
104012004114503 has 2 divisors, whose sum is σ = 104012004114504. Its totient is φ = 104012004114502.
The previous prime is 104012004114409. The next prime is 104012004114509. The reversal of 104012004114503 is 305411400210401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104012004114503 - 236 = 103943284637767 is a prime.
It is a super-2 number, since 2×1040120041145032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104012004114509) 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, 52006002057251 + 52006002057252.
It is an arithmetic number, because the mean of its divisors is an integer number (52006002057252).
Almost surely, 2104012004114503 is an apocalyptic number.
104012004114503 is a deficient number, since it is larger than the sum of its proper divisors (1).
104012004114503 is an equidigital number, since it uses as much as digits as its factorization.
104012004114503 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 104012004114503 its reverse (305411400210401), we get a palindrome (409423404324904).
The spelling of 104012004114503 in words is "one hundred four trillion, twelve billion, four million, one hundred fourteen thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •