Base | Representation |
---|---|
bin | 10110111011011110… |
… | …11000101101101010 |
3 | 1011202220122221211100 |
4 | 23131233120231222 |
5 | 200202342340242 |
6 | 5353304342230 |
7 | 614025206352 |
oct | 133557305552 |
9 | 34686587740 |
10 | 12310121322 |
11 | 5247819394 |
12 | 2476774976 |
13 | 1212497475 |
14 | 84aca7b62 |
15 | 4c0acd54c |
hex | 2ddbd8b6a |
12310121322 has 12 divisors (see below), whose sum is σ = 26671929570. Its totient is φ = 4103373768.
The previous prime is 12310121281. The next prime is 12310121339. The reversal of 12310121322 is 22312101321.
12310121322 is a `hidden beast` number, since 12 + 310 + 1 + 21 + 322 = 666.
It can be written as a sum of positive squares in only one way, i.e., 11552165361 + 757955961 = 107481^2 + 27531^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 683895629 = 12310121322 / (1 + 2 + 3 + 1 + 0 + 1 + 2 + 1 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 12310121295 and 12310121304.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 341947797 + ... + 341947832.
Almost surely, 212310121322 is an apocalyptic number.
12310121322 is an abundant number, since it is smaller than the sum of its proper divisors (14361808248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12310121322 is a wasteful number, since it uses less digits than its factorization.
12310121322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683895637 (or 683895634 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 12310121322 its reverse (22312101321), we get a palindrome (34622222643).
The spelling of 12310121322 in words is "twelve billion, three hundred ten million, one hundred twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •