Base | Representation |
---|---|
bin | 101101010000101000001… |
… | …110111000011100000100 |
3 | 102000100001100221010102012 |
4 | 231100220032320130010 |
5 | 401424223203442012 |
6 | 10340453123033352 |
7 | 440464300643660 |
oct | 55205016703404 |
9 | 12010040833365 |
10 | 3110231312132 |
11 | a9a05054603a |
12 | 42294a20b858 |
13 | 1973a7c28399 |
14 | aa770acd8a0 |
15 | 55d86ccd622 |
hex | 2d4283b8704 |
3110231312132 has 24 divisors (see below), whose sum is σ = 6222194098176. Its totient is φ = 1332585246528.
The previous prime is 3110231312129. The next prime is 3110231312171. The reversal of 3110231312132 is 2312131320113.
It is a junction number, because it is equal to n+sod(n) for n = 3110231312098 and 3110231312107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15357188 + ... + 15558395.
It is an arithmetic number, because the mean of its divisors is an integer number (259258087424).
Almost surely, 23110231312132 is an apocalyptic number.
It is an amenable number.
3110231312132 is an abundant number, since it is smaller than the sum of its proper divisors (3111962786044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3110231312132 is a wasteful number, since it uses less digits than its factorization.
3110231312132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30919187 (or 30919185 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 3110231312132 its reverse (2312131320113), we get a palindrome (5422362632245).
The spelling of 3110231312132 in words is "three trillion, one hundred ten billion, two hundred thirty-one million, three hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •