Base | Representation |
---|---|
bin | 101101011011100110011… |
… | …110110110010000011100 |
3 | 102001110110110110010021211 |
4 | 231123212132312100130 |
5 | 402122340323300012 |
6 | 10350122155434204 |
7 | 441362252343610 |
oct | 55334636662034 |
9 | 12043413403254 |
10 | 3122013103132 |
11 | aa4047007aa0 |
12 | 425097a55964 |
13 | 198534acb751 |
14 | ab16b749340 |
15 | 563262e96a7 |
hex | 2d6e67b641c |
3122013103132 has 96 divisors (see below), whose sum is σ = 7388262637056. Its totient is φ = 1116895180800.
The previous prime is 3122013103073. The next prime is 3122013103169. The reversal of 3122013103132 is 2313013102213.
It is a super-2 number, since 2×31220131031322 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 7056778 + ... + 7486129.
It is an arithmetic number, because the mean of its divisors is an integer number (76961069136).
Almost surely, 23122013103132 is an apocalyptic number.
It is an amenable number.
3122013103132 is an abundant number, since it is smaller than the sum of its proper divisors (4266249533924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3122013103132 is a wasteful number, since it uses less digits than its factorization.
3122013103132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14542987 (or 14542985 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3122013103132 its reverse (2313013102213), we get a palindrome (5435026205345).
The spelling of 3122013103132 in words is "three trillion, one hundred twenty-two billion, thirteen million, one hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •