Base | Representation |
---|---|
bin | 1001011010000011100000… |
… | …1001101010000011011011 |
3 | 1100121210200000102122110211 |
4 | 2112200320021222003123 |
5 | 2323430410131220121 |
6 | 33555340003351551 |
7 | 2115162500321464 |
oct | 226407011520333 |
9 | 40553600378424 |
10 | 10343223304411 |
11 | 33285999a96a8 |
12 | 11b07046825b7 |
13 | 5a0491a776aa |
14 | 27a886971d6b |
15 | 12e0b708bce1 |
hex | 9683826a0db |
10343223304411 has 8 divisors (see below), whose sum is σ = 10614194141040. Its totient is φ = 10075060456032.
The previous prime is 10343223304391. The next prime is 10343223304417. The reversal of 10343223304411 is 11440332234301.
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 10343223304411 - 27 = 10343223304283 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10343223304417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 701989600 + ... + 702004333.
It is an arithmetic number, because the mean of its divisors is an integer number (1326774267630).
Almost surely, 210343223304411 is an apocalyptic number.
10343223304411 is a deficient number, since it is larger than the sum of its proper divisors (270970836629).
10343223304411 is a wasteful number, since it uses less digits than its factorization.
10343223304411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1403994125.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 10343223304411 its reverse (11440332234301), we get a palindrome (21783555538712).
The spelling of 10343223304411 in words is "ten trillion, three hundred forty-three billion, two hundred twenty-three million, three hundred four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •