Base | Representation |
---|---|
bin | 10011010001000001… |
… | …11110110111000101 |
3 | 222200211221201122112 |
4 | 21220200332313011 |
5 | 132140403124031 |
6 | 4430211110405 |
7 | 514214354420 |
oct | 115040766705 |
9 | 28624851575 |
10 | 10343411141 |
11 | 4428649978 |
12 | 2007ba2405 |
13 | c8aba762b |
14 | 7019d69b7 |
15 | 4080e462b |
hex | 26883edc5 |
10343411141 has 8 divisors (see below), whose sum is σ = 11822687424. Its totient is φ = 8864546400.
The previous prime is 10343411081. The next prime is 10343411149. The reversal of 10343411141 is 14111434301.
10343411141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10343411141 - 26 = 10343411077 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 (10343411149) 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 7 ways as a sum of consecutive naturals, for example, 47000 + ... + 151313.
It is an arithmetic number, because the mean of its divisors is an integer number (1477835928).
Almost surely, 210343411141 is an apocalyptic number.
It is an amenable number.
10343411141 is a deficient number, since it is larger than the sum of its proper divisors (1479276283).
10343411141 is an equidigital number, since it uses as much as digits as its factorization.
10343411141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205771.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 10343411141 its reverse (14111434301), we get a palindrome (24454845442).
The spelling of 10343411141 in words is "ten billion, three hundred forty-three million, four hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •