Base | Representation |
---|---|
bin | 110000100101110001… |
… | …1011000011100000111 |
3 | 100222100002212201102011 |
4 | 1201023203120130013 |
5 | 3202200234001242 |
6 | 115534121355051 |
7 | 10352545002466 |
oct | 1411343303407 |
9 | 328302781364 |
10 | 104346781447 |
11 | 40287046367 |
12 | 18281638a87 |
13 | 9abc22b37c |
14 | 509c4849dd |
15 | 2aaab5ed17 |
hex | 184b8d8707 |
104346781447 has 2 divisors, whose sum is σ = 104346781448. Its totient is φ = 104346781446.
The previous prime is 104346781411. The next prime is 104346781453. The reversal of 104346781447 is 744187643401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104346781447 - 231 = 102199297799 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104346781447.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104346701447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52173390723 + 52173390724.
It is an arithmetic number, because the mean of its divisors is an integer number (52173390724).
Almost surely, 2104346781447 is an apocalyptic number.
104346781447 is a deficient number, since it is larger than the sum of its proper divisors (1).
104346781447 is an equidigital number, since it uses as much as digits as its factorization.
104346781447 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1806336, while the sum is 49.
The spelling of 104346781447 in words is "one hundred four billion, three hundred forty-six million, seven hundred eighty-one thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •