Base | Representation |
---|---|
bin | 111000011010000100… |
… | …0010010001010111101 |
3 | 102120200000101001220000 |
4 | 1300310020102022331 |
5 | 3441040204433401 |
6 | 131351550544513 |
7 | 11515543133652 |
oct | 1606410221275 |
9 | 376600331800 |
10 | 121133671101 |
11 | 47410887a93 |
12 | 1b587508139 |
13 | b566026c81 |
14 | 5c11b2bc29 |
15 | 323e78d186 |
hex | 1c342122bd |
121133671101 has 20 divisors (see below), whose sum is σ = 182818272252. Its totient is φ = 79923241728.
The previous prime is 121133671081. The next prime is 121133671121. The reversal of 121133671101 is 101176331121.
121133671101 is a `hidden beast` number, since 1 + 211 + 336 + 7 + 110 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (121133671081) and next prime (121133671121).
It can be written as a sum of positive squares in 2 ways, for example, as 59988745476 + 61144925625 = 244926^2 + 247275^2 .
It is not a de Polignac number, because 121133671101 - 215 = 121133638333 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121133671121) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 7700790 + ... + 7716503.
Almost surely, 2121133671101 is an apocalyptic number.
It is an amenable number.
121133671101 is a deficient number, since it is larger than the sum of its proper divisors (61684601151).
121133671101 is an equidigital number, since it uses as much as digits as its factorization.
121133671101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15417402 (or 15417393 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The spelling of 121133671101 in words is "one hundred twenty-one billion, one hundred thirty-three million, six hundred seventy-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •