Base | Representation |
---|---|
bin | 1001000110000110001011… |
… | …1001110111111001111101 |
3 | 1022102000122010000210110101 |
4 | 2101201202321313321331 |
5 | 2302321200330002303 |
6 | 33134032205041101 |
7 | 2051333553463411 |
oct | 221414271677175 |
9 | 38360563023411 |
10 | 10000343203453 |
11 | 3206138036939 |
12 | 1156172856191 |
13 | 57704a2a1ca5 |
14 | 26803a94ad41 |
15 | 1251ea137d1d |
hex | 91862e77e7d |
10000343203453 has 2 divisors, whose sum is σ = 10000343203454. Its totient is φ = 10000343203452.
The previous prime is 10000343203423. The next prime is 10000343203489. The reversal of 10000343203453 is 35430234300001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8579960730649 + 1420382472804 = 2929157^2 + 1191798^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10000343203453 is a prime.
It is a super-2 number, since 2×100003432034532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000343203423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000171601726 + 5000171601727.
It is an arithmetic number, because the mean of its divisors is an integer number (5000171601727).
Almost surely, 210000343203453 is an apocalyptic number.
It is an amenable number.
10000343203453 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000343203453 is an equidigital number, since it uses as much as digits as its factorization.
10000343203453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 28.
Adding to 10000343203453 its reverse (35430234300001), we get a palindrome (45430577503454).
The spelling of 10000343203453 in words is "ten trillion, three hundred forty-three million, two hundred three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •