Base | Representation |
---|---|
bin | 10011001110010010… |
… | …10101001101011011 |
3 | 222122020201100221201 |
4 | 21213021111031123 |
5 | 132114012342021 |
6 | 4424030415031 |
7 | 513515145616 |
oct | 114711251533 |
9 | 28566640851 |
10 | 10320434011 |
11 | 4416685908 |
12 | 2000361477 |
13 | c861c10b4 |
14 | 6dc93517d |
15 | 4060a6591 |
hex | 26725535b |
10320434011 has 4 divisors (see below), whose sum is σ = 10329625192. Its totient is φ = 10311242832.
The previous prime is 10320433997. The next prime is 10320434051. The reversal of 10320434011 is 11043402301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11043402301 = 389 ⋅28389209.
It is a cyclic number.
It is not a de Polignac number, because 10320434011 - 29 = 10320433499 is a prime.
It is a super-2 number, since 2×103204340112 (a number of 21 digits) contains 22 as substring.
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 10320434011.
It is not an unprimeable number, because it can be changed into a prime (10320434051) 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, 4593906 + ... + 4596151.
It is an arithmetic number, because the mean of its divisors is an integer number (2582406298).
Almost surely, 210320434011 is an apocalyptic number.
10320434011 is a deficient number, since it is larger than the sum of its proper divisors (9191181).
10320434011 is an equidigital number, since it uses as much as digits as its factorization.
10320434011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9191180.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10320434011 its reverse (11043402301), we get a palindrome (21363836312).
The spelling of 10320434011 in words is "ten billion, three hundred twenty million, four hundred thirty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •