Base | Representation |
---|---|
bin | 1110011111101… |
… | …10010111100100 |
3 | 22110210200111000 |
4 | 13033312113210 |
5 | 222112022424 |
6 | 20022113300 |
7 | 3004354302 |
oct | 717662744 |
9 | 273720430 |
10 | 121595364 |
11 | 62701440 |
12 | 3487b830 |
13 | 1c265127 |
14 | 12213272 |
15 | aa1d3c9 |
hex | 73f65e4 |
121595364 has 96 divisors (see below), whose sum is σ = 362073600. Its totient is φ = 34901280.
The previous prime is 121595359. The next prime is 121595371. The reversal of 121595364 is 463595121.
121595364 is a `hidden beast` number, since 1 + 2 + 1 + 595 + 3 + 64 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 19879 + ... + 25265.
It is an arithmetic number, because the mean of its divisors is an integer number (3771600).
Almost surely, 2121595364 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121595364, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181036800).
121595364 is an abundant number, since it is smaller than the sum of its proper divisors (240478236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121595364 is a wasteful number, since it uses less digits than its factorization.
121595364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5430 (or 5422 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
The square root of 121595364 is about 11027.0287929251. The cubic root of 121595364 is about 495.4186357469.
The spelling of 121595364 in words is "one hundred twenty-one million, five hundred ninety-five thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •