Base | Representation |
---|---|
bin | 101101010000100000100… |
… | …101110101010101100100 |
3 | 102000022201102200211112120 |
4 | 231100200211311111210 |
5 | 401423442344023022 |
6 | 10340432303145540 |
7 | 440461153154532 |
oct | 55204045652544 |
9 | 12008642624476 |
10 | 3110103111012 |
11 | a99a951426a7 |
12 | 4229132a52b0 |
13 | 1973874bc631 |
14 | aa75ba7b152 |
15 | 55d7a907d5c |
hex | 2d420975564 |
3110103111012 has 12 divisors (see below), whose sum is σ = 7256907259056. Its totient is φ = 1036701037000.
The previous prime is 3110103110987. The next prime is 3110103111041. The reversal of 3110103111012 is 2101113010113.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×31101031110122 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3110103110982 and 3110103111000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 129587629614 + ... + 129587629637.
It is an arithmetic number, because the mean of its divisors is an integer number (604742271588).
Almost surely, 23110103111012 is an apocalyptic number.
It is an amenable number.
3110103111012 is an abundant number, since it is smaller than the sum of its proper divisors (4146804148044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3110103111012 is a wasteful number, since it uses less digits than its factorization.
3110103111012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259175259258 (or 259175259256 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 3110103111012 its reverse (2101113010113), we get a palindrome (5211216121125).
The spelling of 3110103111012 in words is "three trillion, one hundred ten billion, one hundred three million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •