Base | Representation |
---|---|
bin | 101100011010101011100… |
… | …100111001001010110001 |
3 | 101210210112102000122012211 |
4 | 230122223210321022301 |
5 | 400002110132333231 |
6 | 10254113144452121 |
7 | 433343654304526 |
oct | 54325344711261 |
9 | 11723472018184 |
10 | 3052305355441 |
11 | a77525888461 |
12 | 413682a7a041 |
13 | 191aa609b574 |
14 | a7a3788b14d |
15 | 545e66b6eb1 |
hex | 2c6ab9392b1 |
3052305355441 has 8 divisors (see below), whose sum is σ = 3053558116224. Its totient is φ = 3051052857840.
The previous prime is 3052305355423. The next prime is 3052305355457. The reversal of 3052305355441 is 1445535032503.
3052305355441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3052305355441 - 221 = 3052303258289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3052305355394 and 3052305355403.
It is not an unprimeable number, because it can be changed into a prime (3052305355471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25063800 + ... + 25185286.
It is an arithmetic number, because the mean of its divisors is an integer number (381694764528).
Almost surely, 23052305355441 is an apocalyptic number.
It is an amenable number.
3052305355441 is a deficient number, since it is larger than the sum of its proper divisors (1252760783).
3052305355441 is a wasteful number, since it uses less digits than its factorization.
3052305355441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131591.
The product of its (nonzero) digits is 540000, while the sum is 40.
The spelling of 3052305355441 in words is "three trillion, fifty-two billion, three hundred five million, three hundred fifty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •