Base | Representation |
---|---|
bin | 1001010001111110011000… |
… | …1111011101011010110111 |
3 | 1100010112100212222021120000 |
4 | 2110133212033131122313 |
5 | 2314142112443442333 |
6 | 33411501415442343 |
7 | 2102146540022316 |
oct | 224374617353267 |
9 | 40115325867500 |
10 | 10204410140343 |
11 | 328473654aa01 |
12 | 11898243863b3 |
13 | 59036c04b0a3 |
14 | 273c78c0827d |
15 | 12a690655713 |
hex | 947e63dd6b7 |
10204410140343 has 20 divisors (see below), whose sum is σ = 15567957477600. Its totient is φ = 6658196684832.
The previous prime is 10204410140339. The next prime is 10204410140401. The reversal of 10204410140343 is 34304101440201.
10204410140343 is a `hidden beast` number, since 1 + 0 + 204 + 4 + 10 + 1 + 403 + 43 = 666.
It is not a de Polignac number, because 10204410140343 - 22 = 10204410140339 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10204410140333) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1340212918 + ... + 1340220531.
It is an arithmetic number, because the mean of its divisors is an integer number (778397873880).
Almost surely, 210204410140343 is an apocalyptic number.
10204410140343 is a deficient number, since it is larger than the sum of its proper divisors (5363547337257).
10204410140343 is an equidigital number, since it uses as much as digits as its factorization.
10204410140343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2680433508 (or 2680433499 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 10204410140343 its reverse (34304101440201), we get a palindrome (44508511580544).
The spelling of 10204410140343 in words is "ten trillion, two hundred four billion, four hundred ten million, one hundred forty thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •