Base | Representation |
---|---|
bin | 11110000001101111… |
… | …00110100001101001 |
3 | 1112121110221120022002 |
4 | 33000313212201221 |
5 | 231003344444311 |
6 | 11223350340345 |
7 | 1110325500230 |
oct | 170067464151 |
9 | 45543846262 |
10 | 16120703081 |
11 | 692279790a |
12 | 315a95a6b5 |
13 | 169ba98182 |
14 | accdd1b17 |
15 | 6453d993b |
hex | 3c0de6869 |
16120703081 has 8 divisors (see below), whose sum is σ = 18725688384. Its totient is φ = 13591224720.
The previous prime is 16120703069. The next prime is 16120703099. The reversal of 16120703081 is 18030702161.
16120703081 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.
It is a cyclic number.
It is not a de Polignac number, because 16120703081 - 214 = 16120686697 is a prime.
It is a super-2 number, since 2×161207030812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (16120703681) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 18876275 + ... + 18877128.
It is an arithmetic number, because the mean of its divisors is an integer number (2340711048).
Almost surely, 216120703081 is an apocalyptic number.
It is an amenable number.
16120703081 is a deficient number, since it is larger than the sum of its proper divisors (2604985303).
16120703081 is an equidigital number, since it uses as much as digits as its factorization.
16120703081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37753471.
The product of its (nonzero) digits is 2016, while the sum is 29.
The spelling of 16120703081 in words is "sixteen billion, one hundred twenty million, seven hundred three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •