Base | Representation |
---|---|
bin | 1110100011101… |
… | …11101011001000 |
3 | 22111210121000011 |
4 | 13101313223020 |
5 | 222231000000 |
6 | 20041321304 |
7 | 3012021364 |
oct | 721675310 |
9 | 274717004 |
10 | 122125000 |
11 | 62a33358 |
12 | 34a96234 |
13 | 1c3bc21a |
14 | 123102a4 |
15 | aac52ba |
hex | 7477ac8 |
122125000 has 56 divisors (see below), whose sum is σ = 286519770. Its totient is φ = 48800000.
The previous prime is 122124997. The next prime is 122125001. The reversal of 122125000 is 521221.
It can be written as a sum of positive squares in 7 ways, for example, as 33802596 + 88322404 = 5814^2 + 9398^2 .
It is not an unprimeable number, because it can be changed into a prime (122125001) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 124512 + ... + 125488.
Almost surely, 2122125000 is an apocalyptic number.
122125000 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 122125000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143259885).
122125000 is an abundant number, since it is smaller than the sum of its proper divisors (164394770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122125000 is an frugal number, since it uses more digits than its factorization.
122125000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013 (or 984 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 122125000 is about 11051.0180526502. The cubic root of 122125000 is about 496.1368963962.
Adding to 122125000 its reverse (521221), we get a palindrome (122646221).
The spelling of 122125000 in words is "one hundred twenty-two million, one hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •