Base | Representation |
---|---|
bin | 100100100111101010010011… |
… | …000000010110001101111001 |
3 | 210010020201111022121010001210 |
4 | 210213222103000112031321 |
5 | 132102211421400212121 |
6 | 1330311414155433333 |
7 | 45631564520306634 |
oct | 4447522300261571 |
9 | 703221438533053 |
10 | 161055150007161 |
11 | 47354118530893 |
12 | 16091697a55849 |
13 | 6bb35879907a7 |
14 | 2bab17a270c1b |
15 | 1394632666876 |
hex | 927a93016379 |
161055150007161 has 4 divisors (see below), whose sum is σ = 214740200009552. Its totient is φ = 107370100004772.
The previous prime is 161055150007159. The next prime is 161055150007207. The reversal of 161055150007161 is 161700051550161.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 161055150007161 - 21 = 161055150007159 is a prime.
It is a super-2 number, since 2×1610551500071612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (161055150005161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26842525001191 + ... + 26842525001196.
It is an arithmetic number, because the mean of its divisors is an integer number (53685050002388).
Almost surely, 2161055150007161 is an apocalyptic number.
It is an amenable number.
161055150007161 is a deficient number, since it is larger than the sum of its proper divisors (53685050002391).
161055150007161 is an equidigital number, since it uses as much as digits as its factorization.
161055150007161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53685050002390.
The product of its (nonzero) digits is 31500, while the sum is 39.
The spelling of 161055150007161 in words is "one hundred sixty-one trillion, fifty-five billion, one hundred fifty million, seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •