Base | Representation |
---|---|
bin | 101101010000100001000… |
… | …000001001111001111001 |
3 | 102000022201220200101112201 |
4 | 231100201000021321321 |
5 | 401424001130323001 |
6 | 10340433111110201 |
7 | 440461265623240 |
oct | 55204100117171 |
9 | 12008656611481 |
10 | 3110110011001 |
11 | a99a99025774 |
12 | 422915672361 |
13 | 197388a67176 |
14 | aa75c955957 |
15 | 55d7b31c501 |
hex | 2d421009e79 |
3110110011001 has 32 divisors (see below), whose sum is σ = 3797828418560. Its totient is φ = 2487481482816.
The previous prime is 3110110010899. The next prime is 3110110011011. The reversal of 3110110011001 is 1001100110113.
It is a cyclic number.
It is not a de Polignac number, because 3110110011001 - 213 = 3110110002809 is a prime.
It is a super-4 number, since 4×31101100110014 (a number of 51 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3.
It is not an unprimeable number, because it can be changed into a prime (3110110011011) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 85643290 + ... + 85679596.
It is an arithmetic number, because the mean of its divisors is an integer number (118682138080).
Almost surely, 23110110011001 is an apocalyptic number.
It is an amenable number.
3110110011001 is a deficient number, since it is larger than the sum of its proper divisors (687718407559).
3110110011001 is a wasteful number, since it uses less digits than its factorization.
3110110011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46013.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 3110110011001 its reverse (1001100110113), we get a palindrome (4111210121114).
The spelling of 3110110011001 in words is "three trillion, one hundred ten billion, one hundred ten million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •