Base | Representation |
---|---|
bin | 1001011000100110100… |
… | …1110011001111111010 |
3 | 120102010220221111010000 |
4 | 2112021221303033322 |
5 | 10120141121220422 |
6 | 202022005133430 |
7 | 14435155545552 |
oct | 2261151631772 |
9 | 512126844100 |
10 | 161223226362 |
11 | 62413343240 |
12 | 272b53ba276 |
13 | 12284803bc3 |
14 | 7b3616c162 |
15 | 42d9064cac |
hex | 2589a733fa |
161223226362 has 160 divisors (see below), whose sum is σ = 412112448000. Its totient is φ = 46631803680.
The previous prime is 161223226309. The next prime is 161223226369. The reversal of 161223226362 is 263622322161.
161223226362 is a `hidden beast` number, since 1 + 6 + 12 + 2 + 3 + 2 + 2 + 636 + 2 = 666.
It is a nude number because it is divisible by every one of its digits.
It is not an unprimeable number, because it can be changed into a prime (161223226369) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 20448073 + ... + 20455955.
It is an arithmetic number, because the mean of its divisors is an integer number (2575702800).
Almost surely, 2161223226362 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 161223226362, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (206056224000).
161223226362 is an abundant number, since it is smaller than the sum of its proper divisors (250889221638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161223226362 is a wasteful number, since it uses less digits than its factorization.
161223226362 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8430 (or 8421 counting only the distinct ones).
The product of its digits is 62208, while the sum is 36.
The spelling of 161223226362 in words is "one hundred sixty-one billion, two hundred twenty-three million, two hundred twenty-six thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •