Base | Representation |
---|---|
bin | 1101010010011001001000… |
… | …0001010010001110111001 |
3 | 1220201200000111001210012021 |
4 | 3110212102001102032321 |
5 | 3403331012144142212 |
6 | 51023323434314441 |
7 | 3035340224332351 |
oct | 324462201221671 |
9 | 56650014053167 |
10 | 14609633584057 |
11 | 4722a023164a6 |
12 | 177b540888a21 |
13 | 81c8b46b8745 |
14 | 387177d33b61 |
15 | 1a506b89b307 |
hex | d49920523b9 |
14609633584057 has 2 divisors, whose sum is σ = 14609633584058. Its totient is φ = 14609633584056.
The previous prime is 14609633584033. The next prime is 14609633584141. The reversal of 14609633584057 is 75048533690641.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12626786589561 + 1982846994496 = 3553419^2 + 1408136^2 .
It is a cyclic number.
It is not a de Polignac number, because 14609633584057 - 27 = 14609633583929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14609633583986 and 14609633584004.
It is not a weakly prime, because it can be changed into another prime (14609633584757) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7304816792028 + 7304816792029.
It is an arithmetic number, because the mean of its divisors is an integer number (7304816792029).
Almost surely, 214609633584057 is an apocalyptic number.
It is an amenable number.
14609633584057 is a deficient number, since it is larger than the sum of its proper divisors (1).
14609633584057 is an equidigital number, since it uses as much as digits as its factorization.
14609633584057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 65318400, while the sum is 61.
The spelling of 14609633584057 in words is "fourteen trillion, six hundred nine billion, six hundred thirty-three million, five hundred eighty-four thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •