Base | Representation |
---|---|
bin | 111001000000010000… |
… | …0010101001010101010 |
3 | 102200222022111112000110 |
4 | 1302000200111022222 |
5 | 4001201222340432 |
6 | 132123043115150 |
7 | 11562362461542 |
oct | 1620040251252 |
9 | 380868445013 |
10 | 122415043242 |
11 | 47a09111928 |
12 | 1b884672ab6 |
13 | b70b63c23b |
14 | 5cd3da0322 |
15 | 32b6eeddcc |
hex | 1c808152aa |
122415043242 has 32 divisors (see below), whose sum is σ = 251047710144. Its totient is φ = 39770697600.
The previous prime is 122415043213. The next prime is 122415043243. The reversal of 122415043242 is 242340514221.
It is a happy number.
122415043242 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1224150432423 (a number of 34 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (122415043243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7473 + ... + 494859.
It is an arithmetic number, because the mean of its divisors is an integer number (7845240942).
Almost surely, 2122415043242 is an apocalyptic number.
122415043242 is an abundant number, since it is smaller than the sum of its proper divisors (128632666902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122415043242 is a wasteful number, since it uses less digits than its factorization.
122415043242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488454.
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 122415043242 its reverse (242340514221), we get a palindrome (364755557463).
The spelling of 122415043242 in words is "one hundred twenty-two billion, four hundred fifteen million, forty-three thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •