Base | Representation |
---|---|
bin | 110000011110011011… |
… | …1101000010100001101 |
3 | 100221200221022211021212 |
4 | 1200330313220110031 |
5 | 3201144202243432 |
6 | 115453441304205 |
7 | 10343464031114 |
oct | 1407467502415 |
9 | 327627284255 |
10 | 104100431117 |
11 | 4016aa85751 |
12 | 18213035065 |
13 | 9a80195c47 |
14 | 5077878c7b |
15 | 2a941ec2b2 |
hex | 183cde850d |
104100431117 has 2 divisors, whose sum is σ = 104100431118. Its totient is φ = 104100431116.
The previous prime is 104100431093. The next prime is 104100431203. The reversal of 104100431117 is 711134001401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69228976996 + 34871454121 = 263114^2 + 186739^2 .
It is an emirp because it is prime and its reverse (711134001401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104100431117 - 26 = 104100431053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104100431092 and 104100431101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104100431917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52050215558 + 52050215559.
It is an arithmetic number, because the mean of its divisors is an integer number (52050215559).
Almost surely, 2104100431117 is an apocalyptic number.
It is an amenable number.
104100431117 is a deficient number, since it is larger than the sum of its proper divisors (1).
104100431117 is an equidigital number, since it uses as much as digits as its factorization.
104100431117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 104100431117 its reverse (711134001401), we get a palindrome (815234432518).
The spelling of 104100431117 in words is "one hundred four billion, one hundred million, four hundred thirty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •