Base | Representation |
---|---|
bin | 1000001101110110… |
… | …11001001000001101 |
3 | 102101102110011211021 |
4 | 10012323121020031 |
5 | 33013231400023 |
6 | 2005415154141 |
7 | 214212403303 |
oct | 40673311015 |
9 | 12342404737 |
10 | 4411200013 |
11 | 1964009950 |
12 | a31375951 |
13 | 553b84b2c |
14 | 2dbbd2273 |
15 | 1ac3ec35d |
hex | 106ed920d |
4411200013 has 4 divisors (see below), whose sum is σ = 4812218208. Its totient is φ = 4010181820.
The previous prime is 4411200011. The next prime is 4411200019. The reversal of 4411200013 is 3100021144.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4411200013 - 21 = 4411200011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4411200013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4411200011) 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, 200509081 + ... + 200509102.
It is an arithmetic number, because the mean of its divisors is an integer number (1203054552).
Almost surely, 24411200013 is an apocalyptic number.
It is an amenable number.
4411200013 is a deficient number, since it is larger than the sum of its proper divisors (401018195).
4411200013 is a wasteful number, since it uses less digits than its factorization.
4411200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401018194.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 4411200013 is about 66416.8654258841. The cubic root of 4411200013 is about 1640.0317281439.
Adding to 4411200013 its reverse (3100021144), we get a palindrome (7511221157).
The spelling of 4411200013 in words is "four billion, four hundred eleven million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •