Base | Representation |
---|---|
bin | 1110100101000… |
… | …10111000111100 |
3 | 22112010120211011 |
4 | 13102202320330 |
5 | 222302131022 |
6 | 20045205004 |
7 | 3013356430 |
oct | 722427074 |
9 | 275116734 |
10 | 122302012 |
11 | 63044348 |
12 | 34b60764 |
13 | 1c451971 |
14 | 123589c0 |
15 | ab0c977 |
hex | 74a2e3c |
122302012 has 48 divisors (see below), whose sum is σ = 272643840. Its totient is φ = 46732032.
The previous prime is 122302003. The next prime is 122302013. The reversal of 122302012 is 210203221.
It is a junction number, because it is equal to n+sod(n) for n = 122301983 and 122302001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122302013) 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, 2283 + ... + 15805.
It is an arithmetic number, because the mean of its divisors is an integer number (5680080).
Almost surely, 2122302012 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 122302012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136321920).
122302012 is an abundant number, since it is smaller than the sum of its proper divisors (150341828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122302012 is a wasteful number, since it uses less digits than its factorization.
122302012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13570 (or 13568 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 122302012 is about 11059.0240075696. The cubic root of 122302012 is about 496.3764864000.
Adding to 122302012 its reverse (210203221), we get a palindrome (332505233).
The spelling of 122302012 in words is "one hundred twenty-two million, three hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •