Base | Representation |
---|---|
bin | 10011011001001000… |
… | …00111111001010011 |
3 | 222212120210001020201 |
4 | 21230210013321103 |
5 | 132310300442233 |
6 | 4441035120031 |
7 | 516000646654 |
oct | 115444077123 |
9 | 28776701221 |
10 | 10411343443 |
11 | 4462a28476 |
12 | 20268a3017 |
13 | c9bca0c67 |
14 | 70aa3b52b |
15 | 40e06277d |
hex | 26c907e53 |
10411343443 has 4 divisors (see below), whose sum is σ = 10528324920. Its totient is φ = 10294361968.
The previous prime is 10411343441. The next prime is 10411343597. The reversal of 10411343443 is 34434311401.
It is a happy number.
10411343443 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 10411343443 - 21 = 10411343441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10411343441) 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, 58490605 + ... + 58490782.
It is an arithmetic number, because the mean of its divisors is an integer number (2632081230).
Almost surely, 210411343443 is an apocalyptic number.
10411343443 is a deficient number, since it is larger than the sum of its proper divisors (116981477).
10411343443 is an equidigital number, since it uses as much as digits as its factorization.
10411343443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116981476.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 10411343443 its reverse (34434311401), we get a palindrome (44845654844).
The spelling of 10411343443 in words is "ten billion, four hundred eleven million, three hundred forty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •