Base | Representation |
---|---|
bin | 101101010010010111100… |
… | …111011010000001010001 |
3 | 102000111212121012220212121 |
4 | 231102113213122001101 |
5 | 401442040100341423 |
6 | 10341402355454241 |
7 | 440561511431611 |
oct | 55222747320121 |
9 | 12014777186777 |
10 | 3112100012113 |
11 | a9a91a362a94 |
12 | 42318bbb7381 |
13 | 197615120311 |
14 | aa8aad6aa41 |
15 | 55e45da745d |
hex | 2d4979da051 |
3112100012113 has 4 divisors (see below), whose sum is σ = 3113409269860. Its totient is φ = 3110790754368.
The previous prime is 3112100012111. The next prime is 3112100012123.
It is a happy number.
3112100012113 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 950679600784 + 2161420411329 = 975028^2 + 1470177^2 .
It is a cyclic number.
It is not a de Polignac number, because 3112100012113 - 21 = 3112100012111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3112100012111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 654625308 + ... + 654630061.
It is an arithmetic number, because the mean of its divisors is an integer number (778352317465).
Almost surely, 23112100012113 is an apocalyptic number.
It is an amenable number.
3112100012113 is a deficient number, since it is larger than the sum of its proper divisors (1309257747).
3112100012113 is a wasteful number, since it uses less digits than its factorization.
3112100012113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1309257746.
The product of its (nonzero) digits is 36, while the sum is 16.
It can be divided in two parts, 31121000 and 12113, that added together give a palindrome (31133113).
The spelling of 3112100012113 in words is "three trillion, one hundred twelve billion, one hundred million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •