Base | Representation |
---|---|
bin | 1001001111000110100011… |
… | …00101011001001100000100 |
3 | 2122220121222021222220111102 |
4 | 10213203101211121030010 |
5 | 10130230112113204012 |
6 | 111110201400355232 |
7 | 4164233514201215 |
oct | 447432145311404 |
9 | 78817867886442 |
10 | 20310121616132 |
11 | 6520524194347 |
12 | 23402a2775b18 |
13 | b4430c0714ca |
14 | 50302d73d40c |
15 | 2534a5e272c2 |
hex | 1278d1959304 |
20310121616132 has 6 divisors (see below), whose sum is σ = 35542712828238. Its totient is φ = 10155060808064.
The previous prime is 20310121616123. The next prime is 20310121616167. The reversal of 20310121616132 is 23161612101302.
It can be written as a sum of positive squares in only one way, i.e., 18086784156736 + 2223337459396 = 4252856^2 + 1491086^2 .
It is a junction number, because it is equal to n+sod(n) for n = 20310121616095 and 20310121616104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2538765202013 + ... + 2538765202020.
It is an arithmetic number, because the mean of its divisors is an integer number (5923785471373).
Almost surely, 220310121616132 is an apocalyptic number.
It is an amenable number.
20310121616132 is a deficient number, since it is larger than the sum of its proper divisors (15232591212106).
20310121616132 is a wasteful number, since it uses less digits than its factorization.
20310121616132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5077530404037 (or 5077530404035 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 29.
Adding to 20310121616132 its reverse (23161612101302), we get a palindrome (43471733717434).
The spelling of 20310121616132 in words is "twenty trillion, three hundred ten billion, one hundred twenty-one million, six hundred sixteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •