Base | Representation |
---|---|
bin | 101101001000010100100… |
… | …010101000100111110000 |
3 | 101222111000200210220010100 |
4 | 231020110202220213300 |
5 | 401302441104330222 |
6 | 10332420030032400 |
7 | 440030243434023 |
oct | 55102442504760 |
9 | 11874020726110 |
10 | 3101311011312 |
11 | a9629323aaa8 |
12 | 42107a948700 |
13 | 1965b5b31587 |
14 | aa1661031ba |
15 | 55a13ae64ac |
hex | 2d2148a89f0 |
3101311011312 has 30 divisors (see below), whose sum is σ = 8679363455672. Its totient is φ = 1033770337056.
The previous prime is 3101311011307. The next prime is 3101311011343. The reversal of 3101311011312 is 2131101131013.
3101311011312 is a `hidden beast` number, since 31 + 0 + 1 + 311 + 0 + 11 + 312 = 666.
It is a super-2 number, since 2×31013110113122 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
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 5 ways as a sum of consecutive naturals, for example, 10768440868 + ... + 10768441155.
Almost surely, 23101311011312 is an apocalyptic number.
It is an amenable number.
3101311011312 is an abundant number, since it is smaller than the sum of its proper divisors (5578052444360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3101311011312 is a wasteful number, since it uses less digits than its factorization.
3101311011312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21536882037 (or 21536882028 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 3101311011312 its reverse (2131101131013), we get a palindrome (5232412142325).
The spelling of 3101311011312 in words is "three trillion, one hundred one billion, three hundred eleven million, eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •