Base | Representation |
---|---|
bin | 1101010000100011100001… |
… | …0001111111011101011001 |
3 | 1220121122112021220021222212 |
4 | 3110020320101333131121 |
5 | 3402321333142234342 |
6 | 51001023024324505 |
7 | 3033141666012104 |
oct | 324107021773531 |
9 | 56548467807885 |
10 | 14578063243097 |
11 | 4710581719022 |
12 | 17753aba73735 |
13 | 819922ba3613 |
14 | 38582111573b |
15 | 1a431ee81182 |
hex | d423847f759 |
14578063243097 has 2 divisors, whose sum is σ = 14578063243098. Its totient is φ = 14578063243096.
The previous prime is 14578063243033. The next prime is 14578063243109. The reversal of 14578063243097 is 79034236087541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10438999131136 + 4139064111961 = 3230944^2 + 2034469^2 .
It is a cyclic number.
It is not a de Polignac number, because 14578063243097 - 26 = 14578063243033 is a prime.
It is not a weakly prime, because it can be changed into another prime (14578063242097) 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, 7289031621548 + 7289031621549.
It is an arithmetic number, because the mean of its divisors is an integer number (7289031621549).
It is a 1-persistent number, because it is pandigital, but 2⋅14578063243097 = 29156126486194 is not.
Almost surely, 214578063243097 is an apocalyptic number.
It is an amenable number.
14578063243097 is a deficient number, since it is larger than the sum of its proper divisors (1).
14578063243097 is an equidigital number, since it uses as much as digits as its factorization.
14578063243097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30481920, while the sum is 59.
The spelling of 14578063243097 in words is "fourteen trillion, five hundred seventy-eight billion, sixty-three million, two hundred forty-three thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •