Base | Representation |
---|---|
bin | 111000100101010101… |
… | …1100010000110110001 |
3 | 102121122101021200111210 |
4 | 1301022223202012301 |
5 | 3442324033311121 |
6 | 131453304030333 |
7 | 11531116021203 |
oct | 1611253420661 |
9 | 377571250453 |
10 | 121512010161 |
11 | 475953a87a3 |
12 | 1b6721623a9 |
13 | b5c6523139 |
14 | 5c4a094773 |
15 | 3262ac3876 |
hex | 1c4aae21b1 |
121512010161 has 8 divisors (see below), whose sum is σ = 165072919680. Its totient is φ = 79479553712.
The previous prime is 121512010157. The next prime is 121512010181. The reversal of 121512010161 is 161010215121.
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 121512010161 - 22 = 121512010157 is a prime.
It is a super-2 number, since 2×1215120101612 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121512010111) 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, 382113081 + ... + 382113398.
It is an arithmetic number, because the mean of its divisors is an integer number (20634114960).
Almost surely, 2121512010161 is an apocalyptic number.
It is an amenable number.
121512010161 is a deficient number, since it is larger than the sum of its proper divisors (43560909519).
121512010161 is an equidigital number, since it uses as much as digits as its factorization.
121512010161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764226535.
The product of its (nonzero) digits is 120, while the sum is 21.
Adding to 121512010161 its reverse (161010215121), we get a palindrome (282522225282).
The spelling of 121512010161 in words is "one hundred twenty-one billion, five hundred twelve million, ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •