Base | Representation |
---|---|
bin | 1110011100011… |
… | …01010100001001 |
3 | 22102222211020000 |
4 | 13032031110021 |
5 | 222004240230 |
6 | 20004553213 |
7 | 3000612630 |
oct | 716152411 |
9 | 272884200 |
10 | 121165065 |
11 | 6243811a |
12 | 346b2809 |
13 | 1c144308 |
14 | 12140517 |
15 | a985b60 |
hex | 738d509 |
121165065 has 80 divisors (see below), whose sum is σ = 251834880. Its totient is φ = 54587520.
The previous prime is 121165027. The next prime is 121165073. The reversal of 121165065 is 560561121.
It is a happy number.
121165065 is a `hidden beast` number, since 1 + 2 + 1 + 1 + 650 + 6 + 5 = 666.
It is not a de Polignac number, because 121165065 - 28 = 121164809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 223695 + ... + 224235.
It is an arithmetic number, because the mean of its divisors is an integer number (3147936).
Almost surely, 2121165065 is an apocalyptic number.
121165065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
121165065 is an abundant number, since it is smaller than the sum of its proper divisors (130669815).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121165065 is an equidigital number, since it uses as much as digits as its factorization.
121165065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644 (or 635 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The square root of 121165065 is about 11007.5003974563. The cubic root of 121165065 is about 494.8335528527.
The spelling of 121165065 in words is "one hundred twenty-one million, one hundred sixty-five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •