Base | Representation |
---|---|
bin | 10011011000000011… |
… | …01001010111100111 |
3 | 222211221202212112111 |
4 | 21230001221113213 |
5 | 132300442234021 |
6 | 4440113301451 |
7 | 515531065213 |
oct | 115401512747 |
9 | 28757685474 |
10 | 10402305511 |
11 | 4458915104 |
12 | 2023864887 |
13 | c9a158280 |
14 | 709767943 |
15 | 40d3798e1 |
hex | 26c0695e7 |
10402305511 has 16 divisors (see below), whose sum is σ = 11390278144. Its totient is φ = 9442427904.
The previous prime is 10402305499. The next prime is 10402305553. The reversal of 10402305511 is 11550320401.
It is a happy number.
10402305511 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10402305511 - 25 = 10402305479 is a prime.
It is a super-2 number, since 2×104023055112 (a number of 21 digits) 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 (10402305811) 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 15 ways as a sum of consecutive naturals, for example, 171706 + ... + 224248.
It is an arithmetic number, because the mean of its divisors is an integer number (711892384).
Almost surely, 210402305511 is an apocalyptic number.
10402305511 is a deficient number, since it is larger than the sum of its proper divisors (987972633).
10402305511 is a wasteful number, since it uses less digits than its factorization.
10402305511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52810.
The product of its (nonzero) digits is 600, while the sum is 22.
Adding to 10402305511 its reverse (11550320401), we get a palindrome (21952625912).
The spelling of 10402305511 in words is "ten billion, four hundred two million, three hundred five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •