Base | Representation |
---|---|
bin | 1001011001101010001… |
… | …0000110110100101001 |
3 | 120102212122211022120110 |
4 | 2112122202012310221 |
5 | 10121231121001212 |
6 | 202110043044533 |
7 | 14445164636151 |
oct | 2263242066451 |
9 | 512778738513 |
10 | 161506422057 |
11 | 6254918a372 |
12 | 27374210749 |
13 | 122cb39a016 |
14 | 7b61a09761 |
15 | 4303d54a3c |
hex | 259a886d29 |
161506422057 has 16 divisors (see below), whose sum is σ = 226686340160. Its totient is φ = 101999259072.
The previous prime is 161506422053. The next prime is 161506422059. The reversal of 161506422057 is 750224605161.
It is not a de Polignac number, because 161506422057 - 22 = 161506422053 is a prime.
It is a super-2 number, since 2×1615064220572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (161506422053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1460403 + ... + 1567095.
It is an arithmetic number, because the mean of its divisors is an integer number (14167896260).
Almost surely, 2161506422057 is an apocalyptic number.
It is an amenable number.
161506422057 is a deficient number, since it is larger than the sum of its proper divisors (65179918103).
161506422057 is a wasteful number, since it uses less digits than its factorization.
161506422057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133272.
The product of its (nonzero) digits is 100800, while the sum is 39.
The spelling of 161506422057 in words is "one hundred sixty-one billion, five hundred six million, four hundred twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •