Base | Representation |
---|---|
bin | 1001010001111110001000… |
… | …1111100000110110101111 |
3 | 1100010112012012201111210201 |
4 | 2110133202033200312233 |
5 | 2314141443304424201 |
6 | 33411451021414331 |
7 | 2102145063515554 |
oct | 224374217406657 |
9 | 40115165644721 |
10 | 10204343045551 |
11 | 3284701693666 |
12 | 1189805a0a3a7 |
13 | 59035b188a25 |
14 | 273c6dd40a2b |
15 | 12a689800801 |
hex | 947e23e0daf |
10204343045551 has 8 divisors (see below), whose sum is σ = 10649618997120. Its totient is φ = 9759201165912.
The previous prime is 10204343045549. The next prime is 10204343045593. The reversal of 10204343045551 is 15554034340201.
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 10204343045551 - 21 = 10204343045549 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10204343045551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10204343045531) 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, 33362425 + ... + 33666898.
It is an arithmetic number, because the mean of its divisors is an integer number (1331202374640).
Almost surely, 210204343045551 is an apocalyptic number.
10204343045551 is a deficient number, since it is larger than the sum of its proper divisors (445275951569).
10204343045551 is an equidigital number, since it uses as much as digits as its factorization.
10204343045551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67035965.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 10204343045551 its reverse (15554034340201), we get a palindrome (25758377385752).
The spelling of 10204343045551 in words is "ten trillion, two hundred four billion, three hundred forty-three million, forty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •