Base | Representation |
---|---|
bin | 1011100100100110… |
… | …11000011111100100 |
3 | 121000222012100222110 |
4 | 11302103120133210 |
5 | 100210414312410 |
6 | 2504250401020 |
7 | 306645443034 |
oct | 56223303744 |
9 | 17028170873 |
10 | 6212650980 |
11 | 26a89746a8 |
12 | 1254730170 |
13 | 780162453 |
14 | 42d1658c4 |
15 | 265640720 |
hex | 1724d87e4 |
6212650980 has 48 divisors (see below), whose sum is σ = 18151749504. Its totient is φ = 1584675840.
The previous prime is 6212650973. The next prime is 6212650981. The reversal of 6212650980 is 890562126.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (6212650981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2249581 + ... + 2252340.
It is an arithmetic number, because the mean of its divisors is an integer number (378161448).
Almost surely, 26212650980 is an apocalyptic number.
6212650980 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6212650980 is an abundant number, since it is smaller than the sum of its proper divisors (11939098524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6212650980 is a wasteful number, since it uses less digits than its factorization.
6212650980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4501956 (or 4501954 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The square root of 6212650980 is about 78820.3716053153. The cubic root of 6212650980 is about 1838.3392170089.
The spelling of 6212650980 in words is "six billion, two hundred twelve million, six hundred fifty thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •