Base | Representation |
---|---|
bin | 1001011001010001110… |
… | …1010100101111011001 |
3 | 120102121120001101201110 |
4 | 2112110131110233121 |
5 | 10121024023130144 |
6 | 202052002410533 |
7 | 14442516441054 |
oct | 2262435245731 |
9 | 512546041643 |
10 | 161404505049 |
11 | 624a66a9637 |
12 | 27346060a49 |
13 | 122b3234ab8 |
14 | 7b52279a9b |
15 | 42e9e220b9 |
hex | 2594754bd9 |
161404505049 has 4 divisors (see below), whose sum is σ = 215206006736. Its totient is φ = 107603003364.
The previous prime is 161404505039. The next prime is 161404505051. The reversal of 161404505049 is 940505404161.
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 161404505049 - 224 = 161387727833 is a prime.
It is a super-2 number, since 2×1614045050492 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 161404504998 and 161404505016.
It is not an unprimeable number, because it can be changed into a prime (161404505039) 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, 26900750839 + ... + 26900750844.
It is an arithmetic number, because the mean of its divisors is an integer number (53801501684).
Almost surely, 2161404505049 is an apocalyptic number.
It is an amenable number.
161404505049 is a deficient number, since it is larger than the sum of its proper divisors (53801501687).
161404505049 is an equidigital number, since it uses as much as digits as its factorization.
161404505049 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53801501686.
The product of its (nonzero) digits is 86400, while the sum is 39.
The spelling of 161404505049 in words is "one hundred sixty-one billion, four hundred four million, five hundred five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •