Base | Representation |
---|---|
bin | 110000010110011011111… |
… | …0110000011110010111010 |
3 | 212112021112222202002200200 |
4 | 1200230313312003302322 |
5 | 1332333433314400424 |
6 | 22044441502143030 |
7 | 1254050344165563 |
oct | 140546766036272 |
9 | 25467488662620 |
10 | 6645251325114 |
11 | 213226514a2a6 |
12 | 8b3a89281a76 |
13 | 39284bcb600c |
14 | 18d8bbc4516a |
15 | b7cd183a8c9 |
hex | 60b37d83cba |
6645251325114 has 96 divisors (see below), whose sum is σ = 14597430681600. Its totient is φ = 2184545299200.
The previous prime is 6645251325109. The next prime is 6645251325121. The reversal of 6645251325114 is 4115231525466.
6645251325114 is a `hidden beast` number, since 6 + 6 + 4 + 52 + 51 + 32 + 511 + 4 = 666.
It is a super-2 number, since 2×66452513251142 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6645251325114.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1204065247 + ... + 1204070765.
It is an arithmetic number, because the mean of its divisors is an integer number (152056569600).
Almost surely, 26645251325114 is an apocalyptic number.
6645251325114 is an abundant number, since it is smaller than the sum of its proper divisors (7952179356486).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6645251325114 is a wasteful number, since it uses less digits than its factorization.
6645251325114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7420 (or 7417 counting only the distinct ones).
The product of its digits is 864000, while the sum is 45.
The spelling of 6645251325114 in words is "six trillion, six hundred forty-five billion, two hundred fifty-one million, three hundred twenty-five thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •