Base | Representation |
---|---|
bin | 1001010111110100001… |
… | …1110001001100111001 |
3 | 120101121012100111212121 |
4 | 2111331003301030321 |
5 | 10114223023224123 |
6 | 201545020241241 |
7 | 14430011552122 |
oct | 2257503611471 |
9 | 511535314777 |
10 | 161011929913 |
11 | 6231504507a |
12 | 272566a0221 |
13 | 1224cac2c13 |
14 | 7b16089049 |
15 | 42c572875d |
hex | 257d0f1339 |
161011929913 has 12 divisors (see below), whose sum is σ = 167394267984. Its totient is φ = 154861907400.
The previous prime is 161011929887. The next prime is 161011929929. The reversal of 161011929913 is 319929110161.
It is a de Polignac number, because none of the positive numbers 2k-161011929913 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 161011929913.
It is not an unprimeable number, because it can be changed into a prime (161011929943) 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, 357303 + ... + 670588.
It is an arithmetic number, because the mean of its divisors is an integer number (13949522332).
Almost surely, 2161011929913 is an apocalyptic number.
It is an amenable number.
161011929913 is a deficient number, since it is larger than the sum of its proper divisors (6382338071).
161011929913 is a wasteful number, since it uses less digits than its factorization.
161011929913 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1028116 (or 1028085 counting only the distinct ones).
The product of its (nonzero) digits is 26244, while the sum is 43.
The spelling of 161011929913 in words is "one hundred sixty-one billion, eleven million, nine hundred twenty-nine thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •