Base | Representation |
---|---|
bin | 111000110111010011… |
… | …0011100111001010000 |
3 | 102200012101021100202101 |
4 | 1301232212130321100 |
5 | 4000042323022442 |
6 | 132033152530144 |
7 | 11552054315464 |
oct | 1615646347120 |
9 | 380171240671 |
10 | 122114657872 |
11 | 478745a4959 |
12 | 1b7bbb50954 |
13 | b691337c0c |
14 | 5ca612a4a4 |
15 | 329a965cb7 |
hex | 1c6e99ce50 |
122114657872 has 40 divisors (see below), whose sum is σ = 244524746240. Its totient is φ = 59016263040.
The previous prime is 122114657813. The next prime is 122114657887. The reversal of 122114657872 is 278756411221.
It is a super-2 number, since 2×1221146578722 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 262693 + ... + 559675.
It is an arithmetic number, because the mean of its divisors is an integer number (6113118656).
Almost surely, 2122114657872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122114657872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122262373120).
122114657872 is an abundant number, since it is smaller than the sum of its proper divisors (122410088368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122114657872 is a wasteful number, since it uses less digits than its factorization.
122114657872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297851 (or 297845 counting only the distinct ones).
The product of its digits is 376320, while the sum is 46.
The spelling of 122114657872 in words is "one hundred twenty-two billion, one hundred fourteen million, six hundred fifty-seven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •