Base | Representation |
---|---|
bin | 1001011101100111001100… |
… | …0011100101011001000111 |
3 | 1100211122102102100212200202 |
4 | 2113121303003211121013 |
5 | 2330431042311012333 |
6 | 34043404402201115 |
7 | 2122455162152555 |
oct | 227316303453107 |
9 | 40748372325622 |
10 | 10404341110343 |
11 | 3351502352914 |
12 | 120052095319b |
13 | 5a6181c7b0bb |
14 | 27d803a7abd5 |
15 | 1309929e15e8 |
hex | 976730e5647 |
10404341110343 has 4 divisors (see below), whose sum is σ = 10404695667960. Its totient is φ = 10403986552728.
The previous prime is 10404341110337. The next prime is 10404341110409. The reversal of 10404341110343 is 34301114340401.
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 10404341110343 - 210 = 10404341109319 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 (10404341110843) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 177234788 + ... + 177293481.
It is an arithmetic number, because the mean of its divisors is an integer number (2601173916990).
Almost surely, 210404341110343 is an apocalyptic number.
10404341110343 is a deficient number, since it is larger than the sum of its proper divisors (354557617).
10404341110343 is an equidigital number, since it uses as much as digits as its factorization.
10404341110343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354557616.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 10404341110343 its reverse (34301114340401), we get a palindrome (44705455450744).
The spelling of 10404341110343 in words is "ten trillion, four hundred four billion, three hundred forty-one million, one hundred ten thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •