Base | Representation |
---|---|
bin | 10011001100000110… |
… | …01101011010101011 |
3 | 222120222010110120220 |
4 | 21212003031122223 |
5 | 132044311131021 |
6 | 4422132421123 |
7 | 513202666026 |
oct | 114603153253 |
9 | 28528113526 |
10 | 10302052011 |
11 | 4407270179 |
12 | 1bb61777a3 |
13 | c82456284 |
14 | 6da30c1bd |
15 | 404674cc6 |
hex | 2660cd6ab |
10302052011 has 4 divisors (see below), whose sum is σ = 13736069352. Its totient is φ = 6868034672.
The previous prime is 10302051971. The next prime is 10302052031. The reversal of 10302052011 is 11025020301.
10302052011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10302052011 - 210 = 10302050987 is a prime.
It is a super-2 number, since 2×103020520112 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10302052031) 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 3 ways as a sum of consecutive naturals, for example, 1717008666 + ... + 1717008671.
It is an arithmetic number, because the mean of its divisors is an integer number (3434017338).
Almost surely, 210302052011 is an apocalyptic number.
10302052011 is a deficient number, since it is larger than the sum of its proper divisors (3434017341).
10302052011 is an equidigital number, since it uses as much as digits as its factorization.
10302052011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3434017340.
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 10302052011 its reverse (11025020301), we get a palindrome (21327072312).
The spelling of 10302052011 in words is "ten billion, three hundred two million, fifty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •