Base | Representation |
---|---|
bin | 1110101100010110010010… |
… | …0111001111111001000001 |
3 | 2010012102000220112111011201 |
4 | 3223011210213033321001 |
5 | 4104141030330314221 |
6 | 54205310534141201 |
7 | 3255110306244223 |
oct | 353054447177101 |
9 | 63172026474151 |
10 | 16155060010561 |
11 | 516936023a42a |
12 | 198ab60ab1801 |
13 | 902553178054 |
14 | 3dbca2712413 |
15 | 1d036bd17891 |
hex | eb1649cfe41 |
16155060010561 has 2 divisors, whose sum is σ = 16155060010562. Its totient is φ = 16155060010560.
The previous prime is 16155060010553. The next prime is 16155060010567. The reversal of 16155060010561 is 16501006055161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16078175257600 + 76884752961 = 4009760^2 + 277281^2 .
It is a cyclic number.
It is not a de Polignac number, because 16155060010561 - 23 = 16155060010553 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16155060010561.
It is not a weakly prime, because it can be changed into another prime (16155060010567) 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, 8077530005280 + 8077530005281.
It is an arithmetic number, because the mean of its divisors is an integer number (8077530005281).
Almost surely, 216155060010561 is an apocalyptic number.
It is an amenable number.
16155060010561 is a deficient number, since it is larger than the sum of its proper divisors (1).
16155060010561 is an equidigital number, since it uses as much as digits as its factorization.
16155060010561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 16155060010561 in words is "sixteen trillion, one hundred fifty-five billion, sixty million, ten thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •