Base | Representation |
---|---|
bin | 1001010001111101000101… |
… | …1001110011011101111001 |
3 | 1100010111110112010021002021 |
4 | 2110133101121303131321 |
5 | 2314140403443434203 |
6 | 33411403010234441 |
7 | 2102135063261641 |
oct | 224372131633571 |
9 | 40114415107067 |
10 | 10204060530553 |
11 | 328457717199a |
12 | 1189747285a21 |
13 | 5903147a06a6 |
14 | 273c445dd521 |
15 | 12a66eae75bd |
hex | 947d1673779 |
10204060530553 has 8 divisors (see below), whose sum is σ = 10213704125568. Its totient is φ = 10194417648624.
The previous prime is 10204060530541. The next prime is 10204060530577. The reversal of 10204060530553 is 35503506040201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10204060530553 is a prime.
It is a super-2 number, since 2×102040605305532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10204060530593) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31025950 + ... + 31353112.
It is an arithmetic number, because the mean of its divisors is an integer number (1276713015696).
Almost surely, 210204060530553 is an apocalyptic number.
It is an amenable number.
10204060530553 is a deficient number, since it is larger than the sum of its proper divisors (9643595015).
10204060530553 is a wasteful number, since it uses less digits than its factorization.
10204060530553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356543.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 10204060530553 its reverse (35503506040201), we get a palindrome (45707566570754).
The spelling of 10204060530553 in words is "ten trillion, two hundred four billion, sixty million, five hundred thirty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •