Base | Representation |
---|---|
bin | 1001011001111100100… |
… | …1111001001000001110 |
3 | 120110002001201200102222 |
4 | 2112133021321020032 |
5 | 10121410443214330 |
6 | 202121453015342 |
7 | 14450126001053 |
oct | 2263711711016 |
9 | 513061650388 |
10 | 161583960590 |
11 | 62588a2a1a8 |
12 | 27396184552 |
13 | 12311477c00 |
14 | 7b6c03102a |
15 | 430aa6e0e5 |
hex | 259f27920e |
161583960590 has 96 divisors (see below), whose sum is σ = 334614797280. Its totient is φ = 56046961152.
The previous prime is 161583960523. The next prime is 161583960667. The reversal of 161583960590 is 95069385161.
161583960590 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1615839605902 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1768817 + ... + 1857923.
It is an arithmetic number, because the mean of its divisors is an integer number (3485570805).
Almost surely, 2161583960590 is an apocalyptic number.
161583960590 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
161583960590 is an abundant number, since it is smaller than the sum of its proper divisors (173030836690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161583960590 is a wasteful number, since it uses less digits than its factorization.
161583960590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89206 (or 89193 counting only the distinct ones).
The product of its (nonzero) digits is 1749600, while the sum is 53.
The spelling of 161583960590 in words is "one hundred sixty-one billion, five hundred eighty-three million, nine hundred sixty thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •