Base | Representation |
---|---|
bin | 1001101010001111101000… |
… | …0100111100111010000100 |
3 | 1101121101120110211101211211 |
4 | 2122203322010330322010 |
5 | 2343010013304222024 |
6 | 34331214421541204 |
7 | 2144240033551312 |
oct | 232437204747204 |
9 | 41541513741754 |
10 | 10621354757764 |
11 | 3425544954153 |
12 | 12365a6274804 |
13 | 5c078805b46a |
14 | 28a10d5910b2 |
15 | 136444936594 |
hex | 9a8fa13ce84 |
10621354757764 has 81 divisors (see below), whose sum is σ = 19227234827941. Its totient is φ = 5133903681760.
The previous prime is 10621354757719. The next prime is 10621354757777. The reversal of 10621354757764 is 46775745312601.
The square root of 10621354757764 is 3259042.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2507288567364 + 8114066190400 = 1583442^2 + 2848520^2 .
It is a super-2 number, since 2×106213547577642 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10621354757699 and 10621354757708.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 27304253682 + ... + 27304254070.
Almost surely, 210621354757764 is an apocalyptic number.
10621354757764 is the 3259042-nd square number.
It is an amenable number.
10621354757764 is a deficient number, since it is larger than the sum of its proper divisors (8605880070177).
10621354757764 is an frugal number, since it uses more digits than its factorization.
10621354757764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1042 (or 521 counting only the distinct ones).
The product of its (nonzero) digits is 29635200, while the sum is 58.
The spelling of 10621354757764 in words is "ten trillion, six hundred twenty-one billion, three hundred fifty-four million, seven hundred fifty-seven thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •