Base | Representation |
---|---|
bin | 1001010001111110000101… |
… | …1110001011000101101101 |
3 | 1100010112011022101101101220 |
4 | 2110133201132023011231 |
5 | 2314141432002030331 |
6 | 33411445440253553 |
7 | 2102144545545522 |
oct | 224374136130555 |
9 | 40115138341356 |
10 | 10204330111341 |
11 | 32846a5359a33 |
12 | 11898016112b9 |
13 | 5903585aa752 |
14 | 273c6c335149 |
15 | 12a6885e8296 |
hex | 947e178b16d |
10204330111341 has 8 divisors (see below), whose sum is σ = 13605950991264. Its totient is φ = 6802797986160.
The previous prime is 10204330111337. The next prime is 10204330111351. The reversal of 10204330111341 is 14311103340201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10204330111341 - 22 = 10204330111337 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10204330111331) 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 7 ways as a sum of consecutive naturals, for example, 21919951 + ... + 22380636.
It is an arithmetic number, because the mean of its divisors is an integer number (1700743873908).
Almost surely, 210204330111341 is an apocalyptic number.
It is an amenable number.
10204330111341 is a deficient number, since it is larger than the sum of its proper divisors (3401620879923).
10204330111341 is an equidigital number, since it uses as much as digits as its factorization.
10204330111341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44377371.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 10204330111341 its reverse (14311103340201), we get a palindrome (24515433451542).
The spelling of 10204330111341 in words is "ten trillion, two hundred four billion, three hundred thirty million, one hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •