Base | Representation |
---|---|
bin | 10010111010001010… |
… | …10101111010100010 |
3 | 222012111001112101210 |
4 | 21131011111322202 |
5 | 131242303204122 |
6 | 4355200210550 |
7 | 506365212402 |
oct | 113505257242 |
9 | 28174045353 |
10 | 10151616162 |
11 | 433a360526 |
12 | 1b73909a56 |
13 | c5a233b8c |
14 | 6c434c802 |
15 | 3e635b40c |
hex | 25d155ea2 |
10151616162 has 8 divisors (see below), whose sum is σ = 20303232336. Its totient is φ = 3383872052.
The previous prime is 10151616133. The next prime is 10151616173. The reversal of 10151616162 is 26161615101.
10151616162 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
10151616162 is an admirable number.
It is a super-2 number, since 2×101516161622 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 845968008 + ... + 845968019.
It is an arithmetic number, because the mean of its divisors is an integer number (2537904042).
Almost surely, 210151616162 is an apocalyptic number.
10151616162 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10151616162 is a wasteful number, since it uses less digits than its factorization.
10151616162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1691936032.
The product of its (nonzero) digits is 2160, while the sum is 30.
The spelling of 10151616162 in words is "ten billion, one hundred fifty-one million, six hundred sixteen thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •