Base | Representation |
---|---|
bin | 10111101001011010011110… |
… | …101010111101001111100001 |
3 | 111122020101202111222221112201 |
4 | 113221122132222331033201 |
5 | 102112423022020310434 |
6 | 1005105222213453201 |
7 | 30622552510341325 |
oct | 2751323652751741 |
9 | 448211674887481 |
10 | 104001000166369 |
11 | 30157638325619 |
12 | b7b8110641201 |
13 | 46053382094a7 |
14 | 1b97964d03985 |
15 | c05488490614 |
hex | 5e969eabd3e1 |
104001000166369 has 2 divisors, whose sum is σ = 104001000166370. Its totient is φ = 104001000166368.
The previous prime is 104001000166339. The next prime is 104001000166391. The reversal of 104001000166369 is 963661000100401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102566965176225 + 1434034990144 = 10127535^2 + 1197512^2 .
It is an emirp because it is prime and its reverse (963661000100401) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104001000166369 is a prime.
It is a super-2 number, since 2×1040010001663692 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (104001000166339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52000500083184 + 52000500083185.
It is an arithmetic number, because the mean of its divisors is an integer number (52000500083185).
Almost surely, 2104001000166369 is an apocalyptic number.
It is an amenable number.
104001000166369 is a deficient number, since it is larger than the sum of its proper divisors (1).
104001000166369 is an equidigital number, since it uses as much as digits as its factorization.
104001000166369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 37.
The spelling of 104001000166369 in words is "one hundred four trillion, one billion, one hundred sixty-six thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •