Base | Representation |
---|---|
bin | 1001011010010001010… |
… | …0111000001111100111 |
3 | 120110022002222212002001 |
4 | 2112210110320033213 |
5 | 10122100201223011 |
6 | 202134232430131 |
7 | 14452231334221 |
oct | 2264424701747 |
9 | 513262885061 |
10 | 161670726631 |
11 | 62622a01877 |
12 | 273bb248347 |
13 | 12326436b6b |
14 | 7b79779411 |
15 | 43134ac7c1 |
hex | 25a45383e7 |
161670726631 has 12 divisors (see below), whose sum is σ = 172226808432. Its totient is φ = 151729538048.
The previous prime is 161670726629. The next prime is 161670726709. The reversal of 161670726631 is 136627076161.
161670726631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 161670726631 - 21 = 161670726629 is a prime.
It is a super-2 number, since 2×1616707266312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161670726131) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 690355 + ... + 894388.
It is an arithmetic number, because the mean of its divisors is an integer number (14352234036).
Almost surely, 2161670726631 is an apocalyptic number.
161670726631 is a deficient number, since it is larger than the sum of its proper divisors (10556081801).
161670726631 is a wasteful number, since it uses less digits than its factorization.
161670726631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1585130 (or 1585113 counting only the distinct ones).
The product of its (nonzero) digits is 381024, while the sum is 46.
The spelling of 161670726631 in words is "one hundred sixty-one billion, six hundred seventy million, seven hundred twenty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •