Base | Representation |
---|---|
bin | 110001010001101011110… |
… | …0000010100001001010100 |
3 | 212222102222001112020112010 |
4 | 1202203113200110021110 |
5 | 1341430021402443220 |
6 | 22223123004424220 |
7 | 1266203316303336 |
oct | 142432740241124 |
9 | 25872861466463 |
10 | 6772484031060 |
11 | 218121574a450 |
12 | 914677248070 |
13 | 3a1847772137 |
14 | 195b0b9a1456 |
15 | bb27b7751e0 |
hex | 628d7814254 |
6772484031060 has 48 divisors (see below), whose sum is σ = 20686860315072. Its totient is φ = 1641814310400.
The previous prime is 6772484031043. The next prime is 6772484031109. The reversal of 6772484031060 is 601304842776.
It is a happy number.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
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, 5130669061 + ... + 5130670380.
It is an arithmetic number, because the mean of its divisors is an integer number (430976256564).
Almost surely, 26772484031060 is an apocalyptic number.
6772484031060 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6772484031060 is an abundant number, since it is smaller than the sum of its proper divisors (13914376284012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6772484031060 is a wasteful number, since it uses less digits than its factorization.
6772484031060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10261339464 (or 10261339462 counting only the distinct ones).
The product of its (nonzero) digits is 1354752, while the sum is 48.
The spelling of 6772484031060 in words is "six trillion, seven hundred seventy-two billion, four hundred eighty-four million, thirty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •