Base | Representation |
---|---|
bin | 111000110110111011… |
… | …0001111110100101110 |
3 | 102200011111111100210201 |
4 | 1301231312033310232 |
5 | 4000031104141142 |
6 | 132032022024114 |
7 | 11551542025513 |
oct | 1615566176456 |
9 | 380144440721 |
10 | 122102021422 |
11 | 47868453a07 |
12 | 1b7b787803a |
13 | b68b832324 |
14 | 5ca459b30a |
15 | 32997bbab7 |
hex | 1c6dd8fd2e |
122102021422 has 8 divisors (see below), whose sum is σ = 185041208016. Its totient is φ = 60421618752.
The previous prime is 122102021417. The next prime is 122102021423. The reversal of 122102021422 is 224120201221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1221020214223 (a number of 34 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122102021422.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122102021423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 314695738 + ... + 314696125.
It is an arithmetic number, because the mean of its divisors is an integer number (23130151002).
Almost surely, 2122102021422 is an apocalyptic number.
122102021422 is a deficient number, since it is larger than the sum of its proper divisors (62939186594).
122102021422 is an equidigital number, since it uses as much as digits as its factorization.
122102021422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629391962.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 122102021422 its reverse (224120201221), we get a palindrome (346222222643).
The spelling of 122102021422 in words is "one hundred twenty-two billion, one hundred two million, twenty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •