Base | Representation |
---|---|
bin | 111000111100110100… |
… | …1100101110101110010 |
3 | 102200200022002020221200 |
4 | 1301321221211311302 |
5 | 4000432301432242 |
6 | 132103414032030 |
7 | 11556465051111 |
oct | 1617151456562 |
9 | 380608066850 |
10 | 122300030322 |
11 | 4795a1a6a28 |
12 | 1b852048616 |
13 | b6c0870262 |
14 | 5cc29c1c78 |
15 | 32abd8104c |
hex | 1c79a65d72 |
122300030322 has 48 divisors (see below), whose sum is σ = 266707167480. Its totient is φ = 40502255616.
The previous prime is 122300030317. The next prime is 122300030323. The reversal of 122300030322 is 223030003221.
It is a happy number.
122300030322 is a `hidden beast` number, since 12 + 2 + 300 + 0 + 30 + 322 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 71124089481 + 51175940841 = 266691^2 + 226221^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 122300030295 and 122300030304.
It is not an unprimeable number, because it can be changed into a prime (122300030323) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1884754 + ... + 1948562.
Almost surely, 2122300030322 is an apocalyptic number.
122300030322 is an abundant number, since it is smaller than the sum of its proper divisors (144407137158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122300030322 is a wasteful number, since it uses less digits than its factorization.
122300030322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64507 (or 64504 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 122300030322 its reverse (223030003221), we get a palindrome (345330033543).
The spelling of 122300030322 in words is "one hundred twenty-two billion, three hundred million, thirty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •