Base | Representation |
---|---|
bin | 1110011011010… |
… | …11010111010000 |
3 | 22102201202110110 |
4 | 13031223113100 |
5 | 221440313000 |
6 | 20002001320 |
7 | 2666463324 |
oct | 715532720 |
9 | 272652413 |
10 | 121026000 |
11 | 62352697 |
12 | 34646240 |
13 | 1c0c5c24 |
14 | 12105984 |
15 | a959850 |
hex | 736b5d0 |
121026000 has 160 divisors (see below), whose sum is σ = 407616768. Its totient is φ = 30835200.
The previous prime is 121025999. The next prime is 121026007. The reversal of 121026000 is 620121.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121026007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 137562 + ... + 138438.
Almost surely, 2121026000 is an apocalyptic number.
121026000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121026000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203808384).
121026000 is an abundant number, since it is smaller than the sum of its proper divisors (286590768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121026000 is a wasteful number, since it uses less digits than its factorization.
121026000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 926 (or 910 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 121026000 is about 11001.1817547025. The cubic root of 121026000 is about 494.6441683094.
Adding to 121026000 its reverse (620121), we get a palindrome (121646121).
The spelling of 121026000 in words is "one hundred twenty-one million, twenty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •