Base | Representation |
---|---|
bin | 111000111010001001… |
… | …1010110000011101110 |
3 | 102200110001021010010210 |
4 | 1301310103112003232 |
5 | 4000241314444210 |
6 | 132050451043250 |
7 | 11554325341653 |
oct | 1616423260356 |
9 | 380401233123 |
10 | 122210312430 |
11 | 47913598608 |
12 | 1b827ba0526 |
13 | b6a80b984b |
14 | 5cb4b09c2a |
15 | 32a405ce20 |
hex | 1c744d60ee |
122210312430 has 16 divisors (see below), whose sum is σ = 293304749904. Its totient is φ = 32589416640.
The previous prime is 122210312423. The next prime is 122210312431. The reversal of 122210312430 is 34213012221.
It is a junction number, because it is equal to n+sod(n) for n = 122210312397 and 122210312406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122210312431) 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 7 ways as a sum of consecutive naturals, for example, 2036838511 + ... + 2036838570.
It is an arithmetic number, because the mean of its divisors is an integer number (18331546869).
Almost surely, 2122210312430 is an apocalyptic number.
122210312430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122210312430 is an abundant number, since it is smaller than the sum of its proper divisors (171094437474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122210312430 is a wasteful number, since it uses less digits than its factorization.
122210312430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4073677091.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 122210312430 its reverse (34213012221), we get a palindrome (156423324651).
The spelling of 122210312430 in words is "one hundred twenty-two billion, two hundred ten million, three hundred twelve thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •