Base | Representation |
---|---|
bin | 1001011010001100100… |
… | …0000110101010011001 |
3 | 120110020201010100100112 |
4 | 2112203020012222121 |
5 | 10122030023204401 |
6 | 202132233214105 |
7 | 14451565301600 |
oct | 2264310065231 |
9 | 513221110315 |
10 | 161650600601 |
11 | 62612605896 |
12 | 273b4561335 |
13 | 1232220b279 |
14 | 7b76c1aa37 |
15 | 43118343bb |
hex | 25a3206a99 |
161650600601 has 12 divisors (see below), whose sum is σ = 188067000420. Its totient is φ = 138539630880.
The previous prime is 161650600583. The next prime is 161650600613. The reversal of 161650600601 is 106006056161.
It can be written as a sum of positive squares in 2 ways, for example, as 28950682201 + 132699918400 = 170149^2 + 364280^2 .
It is a de Polignac number, because none of the positive numbers 2k-161650600601 is a prime.
It is a super-2 number, since 2×1616506006012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (161650602601) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 172931 + ... + 594311.
It is an arithmetic number, because the mean of its divisors is an integer number (15672250035).
Almost surely, 2161650600601 is an apocalyptic number.
It is an amenable number.
161650600601 is a deficient number, since it is larger than the sum of its proper divisors (26416399819).
161650600601 is an equidigital number, since it uses as much as digits as its factorization.
161650600601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 429224 (or 429217 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 32.
Adding to 161650600601 its reverse (106006056161), we get a palindrome (267656656762).
The spelling of 161650600601 in words is "one hundred sixty-one billion, six hundred fifty million, six hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •