Base | Representation |
---|---|
bin | 101100000010101010010… |
… | …001010111011101011010 |
3 | 101201022221221101112110010 |
4 | 230002222101113131122 |
5 | 344041244443440032 |
6 | 10234210003102350 |
7 | 431441554416501 |
oct | 54025221273532 |
9 | 11638857345403 |
10 | 3026513655642 |
11 | a675a006a684 |
12 | 40a6853719b6 |
13 | 18c52582a139 |
14 | a66ac2d9838 |
15 | 53ad725bccc |
hex | 2c0aa45775a |
3026513655642 has 8 divisors (see below), whose sum is σ = 6053027311296. Its totient is φ = 1008837885212.
The previous prime is 3026513655637. The next prime is 3026513655647. The reversal of 3026513655642 is 2465563156203.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (3026513655637) and next prime (3026513655647).
It is a sphenic number, since it is the product of 3 distinct primes.
3026513655642 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 3026513655591 and 3026513655600.
It is not an unprimeable number, because it can be changed into a prime (3026513655647) 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, 252209471298 + ... + 252209471309.
It is an arithmetic number, because the mean of its divisors is an integer number (756628413912).
Almost surely, 23026513655642 is an apocalyptic number.
3026513655642 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3026513655642 is a wasteful number, since it uses less digits than its factorization.
3026513655642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 504418942612.
The product of its (nonzero) digits is 3888000, while the sum is 48.
The spelling of 3026513655642 in words is "three trillion, twenty-six billion, five hundred thirteen million, six hundred fifty-five thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •