Base | Representation |
---|---|
bin | 1110100000000… |
… | …01011010100010 |
3 | 22110212222112210 |
4 | 13100001122202 |
5 | 222114444420 |
6 | 20023102550 |
7 | 3004633230 |
oct | 720013242 |
9 | 273788483 |
10 | 121640610 |
11 | 62732433 |
12 | 348a1a56 |
13 | 1c27c8c0 |
14 | 12225950 |
15 | aa2b9e0 |
hex | 74016a2 |
121640610 has 128 divisors (see below), whose sum is σ = 380588544. Its totient is φ = 24145920.
The previous prime is 121640599. The next prime is 121640611. The reversal of 121640610 is 16046121.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (121640611) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 45100 + ... + 47720.
It is an arithmetic number, because the mean of its divisors is an integer number (2973348).
Almost surely, 2121640610 is an apocalyptic number.
121640610 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 121640610, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (190294272).
121640610 is an abundant number, since it is smaller than the sum of its proper divisors (258947934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121640610 is a wasteful number, since it uses less digits than its factorization.
121640610 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2668.
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 121640610 is about 11029.0801973691. The cubic root of 121640610 is about 495.4800770473.
Adding to 121640610 its reverse (16046121), we get a palindrome (137686731).
The spelling of 121640610 in words is "one hundred twenty-one million, six hundred forty thousand, six hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •