Base | Representation |
---|---|
bin | 110000011000101010111… |
… | …0111100011010010010101 |
3 | 212112201221102022001010221 |
4 | 1200301111313203102111 |
5 | 1332423300300000041 |
6 | 22050554002314341 |
7 | 1254310303226461 |
oct | 140612567432225 |
9 | 25481842261127 |
10 | 6650050000021 |
11 | 21342a794982a |
12 | 8b49a83589b1 |
13 | 39313521541c |
14 | 18dc1529b4a1 |
15 | b7eb2c752d1 |
hex | 60c55de3495 |
6650050000021 has 4 divisors (see below), whose sum is σ = 6650173091500. Its totient is φ = 6649926908544.
The previous prime is 6650050000019. The next prime is 6650050000063. The reversal of 6650050000021 is 1200000500566.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4832369010225 + 1817680989796 = 2198265^2 + 1348214^2 .
It is a cyclic number.
It is not a de Polignac number, because 6650050000021 - 21 = 6650050000019 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6650050000921) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61464666 + ... + 61572763.
It is an arithmetic number, because the mean of its divisors is an integer number (1662543272875).
Almost surely, 26650050000021 is an apocalyptic number.
It is an amenable number.
6650050000021 is a deficient number, since it is larger than the sum of its proper divisors (123091479).
6650050000021 is a wasteful number, since it uses less digits than its factorization.
6650050000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123091478.
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 6650050000021 its reverse (1200000500566), we get a palindrome (7850050500587).
The spelling of 6650050000021 in words is "six trillion, six hundred fifty billion, fifty million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •