Base | Representation |
---|---|
bin | 1011111010111100… |
… | …11010010010101111 |
3 | 121112000220022202221 |
4 | 11331132122102233 |
5 | 101101410410221 |
6 | 2535024100211 |
7 | 314412610225 |
oct | 57536322257 |
9 | 17460808687 |
10 | 6400091311 |
11 | 2794759369 |
12 | 12a7464667 |
13 | 7acc3caa3 |
14 | 449dd8b15 |
15 | 276d18541 |
hex | 17d79a4af |
6400091311 has 4 divisors (see below), whose sum is σ = 6402146400. Its totient is φ = 6398036224.
The previous prime is 6400091237. The next prime is 6400091351. The reversal of 6400091311 is 1131900046.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1131900046 = 2 ⋅565950023.
It is a cyclic number.
It is not a de Polignac number, because 6400091311 - 213 = 6400083119 is a prime.
It is a super-2 number, since 2×64000913112 = 81922337578275397442, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6400091351) 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, 1022866 + ... + 1029103.
It is an arithmetic number, because the mean of its divisors is an integer number (1600536600).
Almost surely, 26400091311 is an apocalyptic number.
6400091311 is a deficient number, since it is larger than the sum of its proper divisors (2055089).
6400091311 is a wasteful number, since it uses less digits than its factorization.
6400091311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2055088.
The product of its (nonzero) digits is 648, while the sum is 25.
The square root of 6400091311 is about 80000.5706917144. The cubic root of 6400091311 is about 1856.6443631556.
Adding to 6400091311 its reverse (1131900046), we get a palindrome (7531991357).
The spelling of 6400091311 in words is "six billion, four hundred million, ninety-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •