Base | Representation |
---|---|
bin | 110000011000101011010… |
… | …0001101101001101001100 |
3 | 212112201222012002110211100 |
4 | 1200301112201231031030 |
5 | 1332423311112110300 |
6 | 22050555035223100 |
7 | 1254310466163264 |
oct | 140612641551514 |
9 | 25481865073740 |
10 | 6650061050700 |
11 | 2134303107321 |
12 | 8b49abba7a90 |
13 | 3931375b42a2 |
14 | 18dc169367a4 |
15 | b7eb3c09700 |
hex | 60c5686d34c |
6650061050700 has 108 divisors (see below), whose sum is σ = 21137828061168. Its totient is φ = 1748372841600.
The previous prime is 6650061050687. The next prime is 6650061050701. The reversal of 6650061050700 is 70501600566.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (6650061050701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 51971007 + ... + 52098806.
It is an arithmetic number, because the mean of its divisors is an integer number (195720630196).
Almost surely, 26650061050700 is an apocalyptic number.
6650061050700 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6650061050700 is an abundant number, since it is smaller than the sum of its proper divisors (14487767010468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6650061050700 is a wasteful number, since it uses less digits than its factorization.
6650061050700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104069904 (or 104069894 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The spelling of 6650061050700 in words is "six trillion, six hundred fifty billion, sixty-one million, fifty thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •