Base | Representation |
---|---|
bin | 10010110101010111… |
… | …01101101011101101 |
3 | 222002200021110110211 |
4 | 21122223231223231 |
5 | 131202000441331 |
6 | 4351201102421 |
7 | 505366000051 |
oct | 113253555355 |
9 | 28080243424 |
10 | 10111343341 |
11 | 4319653a00 |
12 | 1b62327a11 |
13 | c51aa30c8 |
14 | 6bcc67c61 |
15 | 3e2a538b1 |
hex | 25aaedaed |
10111343341 has 12 divisors (see below), whose sum is σ = 11228712796. Its totient is φ = 9097355520.
The previous prime is 10111343321. The next prime is 10111343357. The reversal of 10111343341 is 14334311101.
10111343341 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 7200201316 + 2911142025 = 84854^2 + 53955^2 .
It is not a de Polignac number, because 10111343341 - 213 = 10111335149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111343321) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 419010 + ... + 442483.
Almost surely, 210111343341 is an apocalyptic number.
10111343341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10111343341 is a deficient number, since it is larger than the sum of its proper divisors (1117369455).
10111343341 is an equidigital number, since it uses as much as digits as its factorization.
10111343341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861612 (or 861601 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10111343341 its reverse (14334311101), we get a palindrome (24445654442).
The spelling of 10111343341 in words is "ten billion, one hundred eleven million, three hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •