Base | Representation |
---|---|
bin | 101100011010111001111… |
… | …110000001010000100001 |
3 | 101210211011020101110201012 |
4 | 230122321332001100201 |
5 | 400003103441320301 |
6 | 10254153132150305 |
7 | 433352645612261 |
oct | 54327176012041 |
9 | 11724136343635 |
10 | 3052546823201 |
11 | a7763a113797 |
12 | 41372b908395 |
13 | 191b141144b5 |
14 | a7a5b9857a1 |
15 | 5460c9b2ebb |
hex | 2c6b9f81421 |
3052546823201 has 8 divisors (see below), whose sum is σ = 3074882021640. Its totient is φ = 3030212405248.
The previous prime is 3052546823177. The next prime is 3052546823269. The reversal of 3052546823201 is 1023286452503.
It can be written as a sum of positive squares in 4 ways, for example, as 108388442176 + 2944158381025 = 329224^2 + 1715855^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3052546823201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3052546823281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9360785 + ... + 9681393.
It is an arithmetic number, because the mean of its divisors is an integer number (384360252705).
Almost surely, 23052546823201 is an apocalyptic number.
It is an amenable number.
3052546823201 is a deficient number, since it is larger than the sum of its proper divisors (22335198439).
3052546823201 is a wasteful number, since it uses less digits than its factorization.
3052546823201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390243.
The product of its (nonzero) digits is 345600, while the sum is 41.
The spelling of 3052546823201 in words is "three trillion, fifty-two billion, five hundred forty-six million, eight hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •