Base | Representation |
---|---|
bin | 110000110100111101… |
… | …0011101100101111111 |
3 | 101000122121100020110001 |
4 | 1201221322131211333 |
5 | 3204221133221401 |
6 | 120100435055131 |
7 | 10401301361263 |
oct | 1415172354577 |
9 | 330577306401 |
10 | 104856148351 |
11 | 40518620249 |
12 | 183a41414a7 |
13 | 9b70912ac6 |
14 | 5109d980a3 |
15 | 2ada728601 |
hex | 1869e9d97f |
104856148351 has 2 divisors, whose sum is σ = 104856148352. Its totient is φ = 104856148350.
The previous prime is 104856148297. The next prime is 104856148361. The reversal of 104856148351 is 153841658401.
It is a strong prime.
It is an emirp because it is prime and its reverse (153841658401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104856148351 - 219 = 104855624063 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104856148361) 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, 52428074175 + 52428074176.
It is an arithmetic number, because the mean of its divisors is an integer number (52428074176).
Almost surely, 2104856148351 is an apocalyptic number.
104856148351 is a deficient number, since it is larger than the sum of its proper divisors (1).
104856148351 is an equidigital number, since it uses as much as digits as its factorization.
104856148351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 460800, while the sum is 46.
The spelling of 104856148351 in words is "one hundred four billion, eight hundred fifty-six million, one hundred forty-eight thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •