Base | Representation |
---|---|
bin | 111011110111011111011… |
… | …110110100010101000101 |
3 | 112120022001001002101120001 |
4 | 323313133132310111011 |
5 | 1014401014433200401 |
6 | 12425543303041301 |
7 | 603141401236651 |
oct | 73673736642505 |
9 | 15508031071501 |
10 | 4114033100101 |
11 | 134682a483561 |
12 | 5653b1440231 |
13 | 23ac4aa360b2 |
14 | 103198011a61 |
15 | 720371b5601 |
hex | 3bddf7b4545 |
4114033100101 has 4 divisors (see below), whose sum is σ = 4114221037452. Its totient is φ = 4113845162752.
The previous prime is 4114033100059. The next prime is 4114033100153. The reversal of 4114033100101 is 1010013304114.
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 2860918530625 + 1253114569476 = 1691425^2 + 1119426^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4114033100101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4114033100501) 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, 93935836 + ... + 93979621.
It is an arithmetic number, because the mean of its divisors is an integer number (1028555259363).
Almost surely, 24114033100101 is an apocalyptic number.
It is an amenable number.
4114033100101 is a deficient number, since it is larger than the sum of its proper divisors (187937351).
4114033100101 is a wasteful number, since it uses less digits than its factorization.
4114033100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187937350.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 4114033100101 its reverse (1010013304114), we get a palindrome (5124046404215).
The spelling of 4114033100101 in words is "four trillion, one hundred fourteen billion, thirty-three million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •