Base | Representation |
---|---|
bin | 10010111011010111… |
… | …01100011101110000 |
3 | 222020011222022200011 |
4 | 21131223230131300 |
5 | 131302341420000 |
6 | 4400155504304 |
7 | 506546525026 |
oct | 113553543560 |
9 | 28204868604 |
10 | 10161670000 |
11 | 4344aa8089 |
12 | 1b77158094 |
13 | c5c3440b1 |
14 | 6c5808716 |
15 | 3e71952ba |
hex | 25daec770 |
10161670000 has 100 divisors (see below), whose sum is σ = 24793419816. Its totient is φ = 4033120000.
The previous prime is 10161669989. The next prime is 10161670009. The reversal of 10161670000 is 7616101.
It is a tau number, because it is divible by the number of its divisors (100).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10161670009) 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 19 ways as a sum of consecutive naturals, for example, 1306122 + ... + 1313878.
Almost surely, 210161670000 is an apocalyptic number.
10161670000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10161670000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12396709908).
10161670000 is an abundant number, since it is smaller than the sum of its proper divisors (14631749816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10161670000 is an equidigital number, since it uses as much as digits as its factorization.
10161670000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7916 (or 7895 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 22.
The spelling of 10161670000 in words is "ten billion, one hundred sixty-one million, six hundred seventy thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •