Base | Representation |
---|---|
bin | 11011110000111101110001… |
… | …101110100011100000010000 |
3 | 121000100210201211020201100122 |
4 | 123300331301232203200100 |
5 | 112001141112021101112 |
6 | 1111413311315405412 |
7 | 34502211151305326 |
oct | 3360756156434020 |
9 | 530323654221318 |
10 | 122112123222032 |
11 | 359aa508114259 |
12 | 11842192bb3868 |
13 | 531a17c019928 |
14 | 2222388ab5d16 |
15 | e1b63ad2d872 |
hex | 6f0f71ba3810 |
122112123222032 has 40 divisors (see below), whose sum is σ = 251536949515584. Its totient is φ = 57299536072064.
The previous prime is 122112123221983. The next prime is 122112123222097. The reversal of 122112123222032 is 230222321211221.
It is a super-2 number, since 2×1221121232220322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122112123221992 and 122112123222010.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 3130418438 + ... + 3130457445.
Almost surely, 2122112123222032 is an apocalyptic number.
It is an amenable number.
122112123222032 is an abundant number, since it is smaller than the sum of its proper divisors (129424826293552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122112123222032 is a wasteful number, since it uses less digits than its factorization.
122112123222032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6260875967 (or 6260875961 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 122112123222032 its reverse (230222321211221), we get a palindrome (352334444433253).
The spelling of 122112123222032 in words is "one hundred twenty-two trillion, one hundred twelve billion, one hundred twenty-three million, two hundred twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •