Base | Representation |
---|---|
bin | 111000111101110010… |
… | …0011110010110001101 |
3 | 102200202112200211220110 |
4 | 1301323210132112031 |
5 | 4001014023241331 |
6 | 132110524310233 |
7 | 11560335624450 |
oct | 1617344362615 |
9 | 380675624813 |
10 | 122332243341 |
11 | 479763a9060 |
12 | 1b8609a2379 |
13 | b6c743b609 |
14 | 5cc6da9497 |
15 | 32aeae5946 |
hex | 1c7b91e58d |
122332243341 has 16 divisors (see below), whose sum is σ = 203357495808. Its totient is φ = 63549217200.
The previous prime is 122332243333. The next prime is 122332243367. The reversal of 122332243341 is 143342233221.
It is a happy number.
It is not a de Polignac number, because 122332243341 - 23 = 122332243333 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 122332243299 and 122332243308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122332243541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 264788175 + ... + 264788636.
It is an arithmetic number, because the mean of its divisors is an integer number (12709843488).
Almost surely, 2122332243341 is an apocalyptic number.
122332243341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122332243341 is a deficient number, since it is larger than the sum of its proper divisors (81025252467).
122332243341 is a wasteful number, since it uses less digits than its factorization.
122332243341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529576832.
The product of its digits is 20736, while the sum is 30.
Adding to 122332243341 its reverse (143342233221), we get a palindrome (265674476562).
The spelling of 122332243341 in words is "one hundred twenty-two billion, three hundred thirty-two million, two hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •