Base | Representation |
---|---|
bin | 11011101111010101010111… |
… | …110111000101101111110100 |
3 | 120222222002101011110011211221 |
4 | 123233111113313011233310 |
5 | 111442322020121232012 |
6 | 1111250011400440124 |
7 | 34461132141435064 |
oct | 3357252767055764 |
9 | 528862334404757 |
10 | 122000020102132 |
11 | 35966a108a5027 |
12 | 11824507a79044 |
13 | 530c724babaa3 |
14 | 221ab924733a4 |
15 | e187792a4507 |
hex | 6ef557dc5bf4 |
122000020102132 has 96 divisors (see below), whose sum is σ = 222790991754240. Its totient is φ = 58415589181440.
The previous prime is 122000020102043. The next prime is 122000020102133. The reversal of 122000020102132 is 231201020000221.
It is a happy number.
It is a super-2 number, since 2×1220000201021322 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122000020102133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2931192282 + ... + 2931233902.
It is an arithmetic number, because the mean of its divisors is an integer number (2320739497440).
Almost surely, 2122000020102132 is an apocalyptic number.
It is an amenable number.
122000020102132 is a deficient number, since it is larger than the sum of its proper divisors (100790971652108).
122000020102132 is a wasteful number, since it uses less digits than its factorization.
122000020102132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43441 (or 43439 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 122000020102132 its reverse (231201020000221), we get a palindrome (353201040102353).
The spelling of 122000020102132 in words is "one hundred twenty-two trillion, twenty million, one hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •