Base | Representation |
---|---|
bin | 11110111100110000… |
… | …00001101010101001 |
3 | 1120212222110011012100 |
4 | 33132120001222221 |
5 | 233012112221441 |
6 | 11344433004013 |
7 | 1125516322566 |
oct | 173630015251 |
9 | 46788404170 |
10 | 16615742121 |
11 | 7057175a90 |
12 | 32786b3609 |
13 | 174a504194 |
14 | b38a5586d |
15 | 673ac2cb6 |
hex | 3de601aa9 |
16615742121 has 24 divisors (see below), whose sum is σ = 26186771520. Its totient is φ = 10068458400.
The previous prime is 16615742119. The next prime is 16615742147. The reversal of 16615742121 is 12124751661.
16615742121 is a `hidden beast` number, since 1 + 6 + 61 + 574 + 2 + 1 + 21 = 666.
16615742121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 16615742121 - 21 = 16615742119 is a prime.
It is not an unprimeable number, because it can be changed into a prime (16615742161) 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 23 ways as a sum of consecutive naturals, for example, 839740 + ... + 859298.
It is an arithmetic number, because the mean of its divisors is an integer number (1091115480).
Almost surely, 216615742121 is an apocalyptic number.
16615742121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16615742121 is a deficient number, since it is larger than the sum of its proper divisors (9571029399).
16615742121 is a wasteful number, since it uses less digits than its factorization.
16615742121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28157 (or 28154 counting only the distinct ones).
The product of its digits is 20160, while the sum is 36.
The spelling of 16615742121 in words is "sixteen billion, six hundred fifteen million, seven hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •