Base | Representation |
---|---|
bin | 110000001111101101111… |
… | …0111111101110011000000 |
3 | 212110220022111002112101020 |
4 | 1200133123313331303000 |
5 | 1332114411243402242 |
6 | 22034054102105440 |
7 | 1253026662050556 |
oct | 140373367756300 |
9 | 25426274075336 |
10 | 6630823419072 |
11 | 2127130a55a06 |
12 | 8b112141b280 |
13 | 39138cb449c8 |
14 | 18cd0d9c1bd6 |
15 | b7739d806ec |
hex | 607dbdfdcc0 |
6630823419072 has 224 divisors, whose sum is σ = 18807469615872. Its totient is φ = 2054363774976.
The previous prime is 6630823419041. The next prime is 6630823419079. The reversal of 6630823419072 is 2709143280366.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (6630823419079) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1296853188 + ... + 1296858300.
It is an arithmetic number, because the mean of its divisors is an integer number (83961917928).
Almost surely, 26630823419072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6630823419072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9403734807936).
6630823419072 is an abundant number, since it is smaller than the sum of its proper divisors (12176646196800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6630823419072 is a wasteful number, since it uses less digits than its factorization.
6630823419072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10015 (or 10005 counting only the distinct ones).
The product of its (nonzero) digits is 2612736, while the sum is 51.
The spelling of 6630823419072 in words is "six trillion, six hundred thirty billion, eight hundred twenty-three million, four hundred nineteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •