Base | Representation |
---|---|
bin | 101011110110010111011… |
… | …010001101000000000111 |
3 | 101200001212220201100020111 |
4 | 223312113122031000013 |
5 | 343332230422144421 |
6 | 10224144020213451 |
7 | 430463454652315 |
oct | 53662732150007 |
9 | 11601786640214 |
10 | 3013312303111 |
11 | a61a36269080 |
12 | 40800023a287 |
13 | 18b200819636 |
14 | a5bb8d190b5 |
15 | 535b32d4ee1 |
hex | 2bd9768d007 |
3013312303111 has 16 divisors (see below), whose sum is σ = 3393530781696. Its totient is φ = 2650819860000.
The previous prime is 3013312303103. The next prime is 3013312303139. The reversal of 3013312303111 is 1113032133103.
3013312303111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3013312303111 - 23 = 3013312303103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013312303151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4614801 + ... + 5227141.
It is an arithmetic number, because the mean of its divisors is an integer number (212095673856).
Almost surely, 23013312303111 is an apocalyptic number.
3013312303111 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
3013312303111 is a deficient number, since it is larger than the sum of its proper divisors (380218478585).
3013312303111 is a wasteful number, since it uses less digits than its factorization.
3013312303111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626814.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 3013312303111 its reverse (1113032133103), we get a palindrome (4126344436214).
The spelling of 3013312303111 in words is "three trillion, thirteen billion, three hundred twelve million, three hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •