Base | Representation |
---|---|
bin | 111000010110100011… |
… | …1110011110000010111 |
3 | 102120100211011010220021 |
4 | 1300231013303300113 |
5 | 3440320110343012 |
6 | 131332151050011 |
7 | 11512614633406 |
oct | 1605507636027 |
9 | 376324133807 |
10 | 121016106007 |
11 | 47360489655 |
12 | 1b554070907 |
13 | b547873424 |
14 | 5c0028763d |
15 | 32342b9007 |
hex | 1c2d1f3c17 |
121016106007 has 4 divisors (see below), whose sum is σ = 128134700496. Its totient is φ = 113897511520.
The previous prime is 121016105989. The next prime is 121016106023. The reversal of 121016106007 is 700601610121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121016106007 - 27 = 121016105879 is a prime.
It is a super-2 number, since 2×1210161060072 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121016106037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3559297219 + ... + 3559297252.
It is an arithmetic number, because the mean of its divisors is an integer number (32033675124).
Almost surely, 2121016106007 is an apocalyptic number.
121016106007 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
121016106007 is a deficient number, since it is larger than the sum of its proper divisors (7118594489).
121016106007 is an equidigital number, since it uses as much as digits as its factorization.
121016106007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7118594488.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 121016106007 its reverse (700601610121), we get a palindrome (821617716128).
The spelling of 121016106007 in words is "one hundred twenty-one billion, sixteen million, one hundred six thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.258 sec. • engine limits •