Base | Representation |
---|---|
bin | 100100100110111011100111… |
… | …001000000111010110011010 |
3 | 210010001221002210101101022001 |
4 | 210212323213020013112122 |
5 | 132100401241030101020 |
6 | 1330232404052351214 |
7 | 45625141350024664 |
oct | 4446734710072632 |
9 | 703057083341261 |
10 | 161005021722010 |
11 | 47334934408254 |
12 | 16083a2801550a |
13 | 6bab9294859bb |
14 | 2ba89828a9534 |
15 | 139319b8d150a |
hex | 926ee720759a |
161005021722010 has 8 divisors (see below), whose sum is σ = 289809039099636. Its totient is φ = 64402008688800.
The previous prime is 161005021721923. The next prime is 161005021722031. The reversal of 161005021722010 is 10227120500161.
161005021722010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 158232926590489 + 2772095131521 = 12579067^2 + 1664961^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 161005021722010.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8050251086091 + ... + 8050251086110.
Almost surely, 2161005021722010 is an apocalyptic number.
161005021722010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
161005021722010 is a deficient number, since it is larger than the sum of its proper divisors (128804017377626).
161005021722010 is a wasteful number, since it uses less digits than its factorization.
161005021722010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16100502172208.
The product of its (nonzero) digits is 1680, while the sum is 28.
The spelling of 161005021722010 in words is "one hundred sixty-one trillion, five billion, twenty-one million, seven hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •