Base | Representation |
---|---|
bin | 1110100110001… |
… | …01111111001000 |
3 | 22112101220000110 |
4 | 13103011333020 |
5 | 222321231033 |
6 | 20052234320 |
7 | 3014525514 |
oct | 723057710 |
9 | 275356013 |
10 | 122445768 |
11 | 63132355 |
12 | 3500b9a0 |
13 | 1c4a2223 |
14 | 12395144 |
15 | ab3a363 |
hex | 74c5fc8 |
122445768 has 64 divisors (see below), whose sum is σ = 318700800. Its totient is φ = 39170880.
The previous prime is 122445761. The next prime is 122445769. The reversal of 122445768 is 867544221.
It is a super-2 number, since 2×1224457682 = 29985932202219648, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122445761) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59883 + ... + 61893.
It is an arithmetic number, because the mean of its divisors is an integer number (4979700).
Almost surely, 2122445768 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 122445768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159350400).
122445768 is an abundant number, since it is smaller than the sum of its proper divisors (196255032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122445768 is a wasteful number, since it uses less digits than its factorization.
122445768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2122 (or 2118 counting only the distinct ones).
The product of its digits is 107520, while the sum is 39.
The square root of 122445768 is about 11065.5215873451. The cubic root of 122445768 is about 496.5708935541.
Adding to 122445768 its reverse (867544221), we get a palindrome (989989989).
The spelling of 122445768 in words is "one hundred twenty-two million, four hundred forty-five thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •