Base | Representation |
---|---|
bin | 111000110111001010… |
… | …1111010101010000100 |
3 | 102200012002010010212212 |
4 | 1301232111322222010 |
5 | 4000040220321312 |
6 | 132032520002552 |
7 | 11552002423364 |
oct | 1615625725204 |
9 | 380162103785 |
10 | 122110323332 |
11 | 47872104298 |
12 | 1b7ba600458 |
13 | b69047acba |
14 | 5ca571c9a4 |
15 | 329a3ab822 |
hex | 1c6e57aa84 |
122110323332 has 12 divisors (see below), whose sum is σ = 226263246300. Its totient is φ = 57463681536.
The previous prime is 122110323331. The next prime is 122110323371. The reversal of 122110323332 is 233323011221.
It can be written as a sum of positive squares in 2 ways, for example, as 54435422596 + 67674900736 = 233314^2 + 260144^2 .
It is a junction number, because it is equal to n+sod(n) for n = 122110323298 and 122110323307.
It is not an unprimeable number, because it can be changed into a prime (122110323331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 897869957 + ... + 897870092.
It is an arithmetic number, because the mean of its divisors is an integer number (18855270525).
Almost surely, 2122110323332 is an apocalyptic number.
It is an amenable number.
122110323332 is a deficient number, since it is larger than the sum of its proper divisors (104152922968).
122110323332 is a wasteful number, since it uses less digits than its factorization.
122110323332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1795740070 (or 1795740068 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 122110323332 its reverse (233323011221), we get a palindrome (355433334553).
The spelling of 122110323332 in words is "one hundred twenty-two billion, one hundred ten million, three hundred twenty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •