Base | Representation |
---|---|
bin | 10111101001100100101110… |
… | …100011101011111111101001 |
3 | 111122021110011101212102110211 |
4 | 113221210232203223333221 |
5 | 102113113041023130114 |
6 | 1005114242142341121 |
7 | 30623422265346436 |
oct | 2751445643537751 |
9 | 448243141772424 |
10 | 104012004114409 |
11 | 3016127480a656 |
12 | b7ba28188a7a1 |
13 | 460639cbb6b51 |
14 | 1b982ca520b8d |
15 | c058ce55e6c4 |
hex | 5e992e8ebfe9 |
104012004114409 has 2 divisors, whose sum is σ = 104012004114410. Its totient is φ = 104012004114408.
The previous prime is 104012004114397. The next prime is 104012004114503. The reversal of 104012004114409 is 904411400210401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99821140048809 + 4190864065600 = 9991053^2 + 2047160^2 .
It is a cyclic number.
It is not a de Polignac number, because 104012004114409 - 25 = 104012004114377 is a prime.
It is a super-2 number, since 2×1040120041144092 (a number of 29 digits) contains 22 as substring.
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 (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52006002057204 + 52006002057205.
It is an arithmetic number, because the mean of its divisors is an integer number (52006002057205).
Almost surely, 2104012004114409 is an apocalyptic number.
It is an amenable number.
104012004114409 is a deficient number, since it is larger than the sum of its proper divisors (1).
104012004114409 is an equidigital number, since it uses as much as digits as its factorization.
104012004114409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 31.
The spelling of 104012004114409 in words is "one hundred four trillion, twelve billion, four million, one hundred fourteen thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •