Base | Representation |
---|---|
bin | 11011110100001000110101… |
… | …010010010011001001100110 |
3 | 121001010122111122211100002222 |
4 | 123310020311102103021212 |
5 | 112013224123020423100 |
6 | 1112101410220032342 |
7 | 34524030134564240 |
oct | 3364106522231146 |
9 | 531118448740088 |
10 | 122330152514150 |
11 | 35a83a20a54479 |
12 | 118784a06926b2 |
13 | 53348b7654099 |
14 | 222cb4d44b090 |
15 | e2214bee5485 |
hex | 6f4235493266 |
122330152514150 has 96 divisors (see below), whose sum is σ = 261863944009920. Its totient is φ = 41647757598720.
The previous prime is 122330152514149. The next prime is 122330152514179. The reversal of 122330152514150 is 51415251033221.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 122330152514150.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 84620606 + ... + 86054094.
It is an arithmetic number, because the mean of its divisors is an integer number (2727749416770).
Almost surely, 2122330152514150 is an apocalyptic number.
122330152514150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122330152514150 is an abundant number, since it is smaller than the sum of its proper divisors (139533791495770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122330152514150 is a wasteful number, since it uses less digits than its factorization.
122330152514150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1435218 (or 1435213 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 35.
The spelling of 122330152514150 in words is "one hundred twenty-two trillion, three hundred thirty billion, one hundred fifty-two million, five hundred fourteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.163 sec. • engine limits •