Base | Representation |
---|---|
bin | 11011110000000101001001… |
… | …101100010100101001110100 |
3 | 121000010222210111000221000110 |
4 | 123300011021230110221310 |
5 | 111444142101413144012 |
6 | 1111325334150343020 |
7 | 34464626352431241 |
oct | 3360051154245164 |
9 | 530128714027013 |
10 | 122051322006132 |
11 | 359867474458a2 |
12 | 1183244495aa70 |
13 | 531450c5a22bc |
14 | 221d45ba5c5c8 |
15 | e19c7d0b373c |
hex | 6f0149b14a74 |
122051322006132 has 24 divisors (see below), whose sum is σ = 284948320518400. Its totient is φ = 40660645072896.
The previous prime is 122051322006083. The next prime is 122051322006139. The reversal of 122051322006132 is 231600223150221.
It is a self number, because there is not a number n which added to its sum of digits gives 122051322006132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122051322006139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2891094157 + ... + 2891136372.
Almost surely, 2122051322006132 is an apocalyptic number.
122051322006132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122051322006132 is an abundant number, since it is smaller than the sum of its proper divisors (162896998512268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122051322006132 is a wasteful number, since it uses less digits than its factorization.
122051322006132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5782232295 (or 5782232293 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 122051322006132 its reverse (231600223150221), we get a palindrome (353651545156353).
The spelling of 122051322006132 in words is "one hundred twenty-two trillion, fifty-one billion, three hundred twenty-two million, six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •