Base | Representation |
---|---|
bin | 1110101001111101111100… |
… | …1000010101101100000001 |
3 | 2010001111110220220222220101 |
4 | 3222133133020111230001 |
5 | 4103003302423114244 |
6 | 54134425014042401 |
7 | 3252132023413156 |
oct | 352373710255401 |
9 | 63044426828811 |
10 | 16114165832449 |
11 | 5152a85576113 |
12 | 1983049649401 |
13 | 8cb736a8a019 |
14 | 3d9d034a222d |
15 | 1ce276aa40d4 |
hex | ea7df215b01 |
16114165832449 has 2 divisors, whose sum is σ = 16114165832450. Its totient is φ = 16114165832448.
The previous prime is 16114165832407. The next prime is 16114165832483. The reversal of 16114165832449 is 94423856141161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14678147076849 + 1436018755600 = 3831207^2 + 1198340^2 .
It is a cyclic number.
It is not a de Polignac number, because 16114165832449 - 213 = 16114165824257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16114165832449.
It is not a weakly prime, because it can be changed into another prime (16114165832749) 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, 8057082916224 + 8057082916225.
It is an arithmetic number, because the mean of its divisors is an integer number (8057082916225).
Almost surely, 216114165832449 is an apocalyptic number.
It is an amenable number.
16114165832449 is a deficient number, since it is larger than the sum of its proper divisors (1).
16114165832449 is an equidigital number, since it uses as much as digits as its factorization.
16114165832449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4976640, while the sum is 55.
The spelling of 16114165832449 in words is "sixteen trillion, one hundred fourteen billion, one hundred sixty-five million, eight hundred thirty-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •