Base | Representation |
---|---|
bin | 111000111010101111… |
… | …1101101011011111100 |
3 | 102200111102221011122012 |
4 | 1301311133231123330 |
5 | 4000311431044012 |
6 | 132052444110352 |
7 | 11554660446350 |
oct | 1616537553374 |
9 | 380442834565 |
10 | 122230331132 |
11 | 47923920998 |
12 | 1b8328353b8 |
13 | b6ac2a8630 |
14 | 5cb763b460 |
15 | 32a5bb4622 |
hex | 1c757ed6fc |
122230331132 has 96 divisors (see below), whose sum is σ = 266133504000. Its totient is φ = 47829180672.
The previous prime is 122230331071. The next prime is 122230331183. The reversal of 122230331132 is 231133032221.
It is a junction number, because it is equal to n+sod(n) for n = 122230331098 and 122230331107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47950994 + ... + 47953542.
It is an arithmetic number, because the mean of its divisors is an integer number (2772224000).
Almost surely, 2122230331132 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 122230331132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133066752000).
122230331132 is an abundant number, since it is smaller than the sum of its proper divisors (143903172868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122230331132 is a wasteful number, since it uses less digits than its factorization.
122230331132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3955 (or 3953 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 122230331132 its reverse (231133032221), we get a palindrome (353363363353).
The spelling of 122230331132 in words is "one hundred twenty-two billion, two hundred thirty million, three hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •