Base | Representation |
---|---|
bin | 101100011011110100110… |
… | …100111110111101111111 |
3 | 101210220201001112000022101 |
4 | 230123310310332331333 |
5 | 400012114240412041 |
6 | 10254435125325531 |
7 | 433416266246314 |
oct | 54336464767577 |
9 | 11726631460271 |
10 | 3053534310271 |
11 | a77aa6570405 |
12 | 4139665668a7 |
13 | 191c40890083 |
14 | a7b12b96d0b |
15 | 54669521b31 |
hex | 2c6f4d3ef7f |
3053534310271 has 16 divisors (see below), whose sum is σ = 3114317295936. Its totient is φ = 2993316581376.
The previous prime is 3053534310241. The next prime is 3053534310329. The reversal of 3053534310271 is 1720134353503.
It is a cyclic number.
It is not a de Polignac number, because 3053534310271 - 215 = 3053534277503 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3053534310271.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3053534310241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8129511 + ... + 8496823.
It is an arithmetic number, because the mean of its divisors is an integer number (194644830996).
Almost surely, 23053534310271 is an apocalyptic number.
3053534310271 is a deficient number, since it is larger than the sum of its proper divisors (60782985665).
3053534310271 is a wasteful number, since it uses less digits than its factorization.
3053534310271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368082.
The product of its (nonzero) digits is 113400, while the sum is 37.
Adding to 3053534310271 its reverse (1720134353503), we get a palindrome (4773668663774).
The spelling of 3053534310271 in words is "three trillion, fifty-three billion, five hundred thirty-four million, three hundred ten thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •