Base | Representation |
---|---|
bin | 1110011100010… |
… | …10000111100010 |
3 | 22102222011021000 |
4 | 13032022013202 |
5 | 222003330340 |
6 | 20004412430 |
7 | 3000526512 |
oct | 716120742 |
9 | 272864230 |
10 | 121151970 |
11 | 624292a5 |
12 | 346a7116 |
13 | 1c13b374 |
14 | 12139842 |
15 | a981d30 |
hex | 738a1e2 |
121151970 has 64 divisors (see below), whose sum is σ = 324051840. Its totient is φ = 32209344.
The previous prime is 121151969. The next prime is 121151993. The reversal of 121151970 is 79151121.
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 31 ways as a sum of consecutive naturals, for example, 151612 + ... + 152408.
It is an arithmetic number, because the mean of its divisors is an integer number (5063310).
Almost surely, 2121151970 is an apocalyptic number.
121151970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 121151970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162025920).
121151970 is an abundant number, since it is smaller than the sum of its proper divisors (202899870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121151970 is a wasteful number, since it uses less digits than its factorization.
121151970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1376 (or 1370 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 27.
The square root of 121151970 is about 11006.9055596930. The cubic root of 121151970 is about 494.8157257152.
The spelling of 121151970 in words is "one hundred twenty-one million, one hundred fifty-one thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.825 sec. • engine limits •