Base | Representation |
---|---|
bin | 10101010011000010… |
… | …10001010111111101 |
3 | 1002111212002200120012 |
4 | 22221201101113331 |
5 | 141404101143023 |
6 | 5130330233005 |
7 | 553226306333 |
oct | 125141212775 |
9 | 32455080505 |
10 | 11434006013 |
11 | 493821aa51 |
12 | 2271285765 |
13 | 1102b14441 |
14 | 7a67a7b53 |
15 | 46dc1d978 |
hex | 2a98515fd |
11434006013 has 4 divisors (see below), whose sum is σ = 12106594620. Its totient is φ = 10761417408.
The previous prime is 11434005977. The next prime is 11434006019. The reversal of 11434006013 is 31060043411.
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 7351690564 + 4082315449 = 85742^2 + 63893^2 .
It is a cyclic number.
It is not a de Polignac number, because 11434006013 - 28 = 11434005757 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 11434006013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11434006019) 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, 336294278 + ... + 336294311.
It is an arithmetic number, because the mean of its divisors is an integer number (3026648655).
Almost surely, 211434006013 is an apocalyptic number.
It is an amenable number.
11434006013 is a deficient number, since it is larger than the sum of its proper divisors (672588607).
11434006013 is an equidigital number, since it uses as much as digits as its factorization.
11434006013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 672588606.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11434006013 its reverse (31060043411), we get a palindrome (42494049424).
The spelling of 11434006013 in words is "eleven billion, four hundred thirty-four million, six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •