Base | Representation |
---|---|
bin | 11101100101011110010… |
… | …10101110000111010001 |
3 | 10121011220012020200012002 |
4 | 32302233022232013101 |
5 | 113123344040324402 |
6 | 2054555214043345 |
7 | 133305040552262 |
oct | 16625712560721 |
9 | 3534805220162 |
10 | 1016551104977 |
11 | 362131663051 |
12 | 145020aa9555 |
13 | 74b2528b195 |
14 | 372b6674969 |
15 | 1b69981c602 |
hex | ecaf2ae1d1 |
1016551104977 has 2 divisors, whose sum is σ = 1016551104978. Its totient is φ = 1016551104976.
The previous prime is 1016551104971. The next prime is 1016551104979. The reversal of 1016551104977 is 7794011556101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 694062274816 + 322488830161 = 833104^2 + 567881^2 .
It is an emirp because it is prime and its reverse (7794011556101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1016551104977 - 212 = 1016551100881 is a prime.
It is a super-2 number, since 2×10165511049772 (a number of 25 digits) contains 22 as substring.
Together with 1016551104979, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1016551104971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 508275552488 + 508275552489.
It is an arithmetic number, because the mean of its divisors is an integer number (508275552489).
Almost surely, 21016551104977 is an apocalyptic number.
It is an amenable number.
1016551104977 is a deficient number, since it is larger than the sum of its proper divisors (1).
1016551104977 is an equidigital number, since it uses as much as digits as its factorization.
1016551104977 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 264600, while the sum is 47.
The spelling of 1016551104977 in words is "one trillion, sixteen billion, five hundred fifty-one million, one hundred four thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •