Base | Representation |
---|---|
bin | 1001101011100011001000… |
… | …1001000101111110010010 |
3 | 1101200112102122110001111010 |
4 | 2122320302021011332102 |
5 | 2343341420133012200 |
6 | 34345402554431350 |
7 | 2145662355653544 |
oct | 232706211057622 |
9 | 41615378401433 |
10 | 10643770204050 |
11 | 3433aa7885775 |
12 | 123aa01132556 |
13 | 5c291ac9c549 |
14 | 28b238597694 |
15 | 136d0777a150 |
hex | 9ae32245f92 |
10643770204050 has 96 divisors (see below), whose sum is σ = 28081750849344. Its totient is φ = 2658716928000.
The previous prime is 10643770204013. The next prime is 10643770204051. The reversal of 10643770204050 is 5040207734601.
It is a super-2 number, since 2×106437702040502 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10643770204051) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9353011 + ... + 10429110.
It is an arithmetic number, because the mean of its divisors is an integer number (292518238014).
Almost surely, 210643770204050 is an apocalyptic number.
10643770204050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10643770204050 is an abundant number, since it is smaller than the sum of its proper divisors (17437980645294).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10643770204050 is a wasteful number, since it uses less digits than its factorization.
10643770204050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19782364 (or 19782359 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 39.
Adding to 10643770204050 its reverse (5040207734601), we get a palindrome (15683977938651).
The spelling of 10643770204050 in words is "ten trillion, six hundred forty-three billion, seven hundred seventy million, two hundred four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •