Base | Representation |
---|---|
bin | 110000110100111110… |
… | …0011010000111011111 |
3 | 101000122122022011002201 |
4 | 1201221330122013133 |
5 | 3204221301032044 |
6 | 120100454032331 |
7 | 10401305614303 |
oct | 1415174320737 |
9 | 330578264081 |
10 | 104856658399 |
11 | 40518939479 |
12 | 183a43486a7 |
13 | 9b70a60ccc |
14 | 510a08bd03 |
15 | 2ada7c97d4 |
hex | 1869f1a1df |
104856658399 has 2 divisors, whose sum is σ = 104856658400. Its totient is φ = 104856658398.
The previous prime is 104856658397. The next prime is 104856658409. The reversal of 104856658399 is 993856658401.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 104856658399 - 21 = 104856658397 is a prime.
Together with 104856658397, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 104856658399.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104856658391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52428329199 + 52428329200.
It is an arithmetic number, because the mean of its divisors is an integer number (52428329200).
Almost surely, 2104856658399 is an apocalyptic number.
104856658399 is a deficient number, since it is larger than the sum of its proper divisors (1).
104856658399 is an equidigital number, since it uses as much as digits as its factorization.
104856658399 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55987200, while the sum is 64.
The spelling of 104856658399 in words is "one hundred four billion, eight hundred fifty-six million, six hundred fifty-eight thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •