Base | Representation |
---|---|
bin | 1110001001001000100000… |
… | …10101101001110100110100 |
3 | 11002010010212200201011121211 |
4 | 13010210100111221310310 |
5 | 13034021032332132012 |
6 | 150051111544251204 |
7 | 6356624161563235 |
oct | 704442025516464 |
9 | 132103780634554 |
10 | 31100132302132 |
11 | 9a005459a6653 |
12 | 35a34b7470b04 |
13 | 144796475aaba |
14 | 79737c25308c |
15 | 38debc1b06a7 |
hex | 1c4910569d34 |
31100132302132 has 48 divisors (see below), whose sum is σ = 55611623088000. Its totient is φ = 15215060196864.
The previous prime is 31100132302103. The next prime is 31100132302157. The reversal of 31100132302132 is 23120323100113.
It is a super-2 number, since 2×311001323021322 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
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 in 15 ways as a sum of consecutive naturals, for example, 34562344 + ... + 35450752.
It is an arithmetic number, because the mean of its divisors is an integer number (1158575481000).
Almost surely, 231100132302132 is an apocalyptic number.
It is an amenable number.
31100132302132 is a deficient number, since it is larger than the sum of its proper divisors (24511490785868).
31100132302132 is a wasteful number, since it uses less digits than its factorization.
31100132302132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889528 (or 889526 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 31100132302132 its reverse (23120323100113), we get a palindrome (54220455402245).
It can be divided in two parts, 3110013 and 2302132, that added together give a palindrome (5412145).
The spelling of 31100132302132 in words is "thirty-one trillion, one hundred billion, one hundred thirty-two million, three hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •