Base | Representation |
---|---|
bin | 101100011011110100101… |
… | …001001001001010011101 |
3 | 101210220200211200022110112 |
4 | 230123310221021022131 |
5 | 400012112442100201 |
6 | 10254434535015405 |
7 | 433416231000662 |
oct | 54336451111235 |
9 | 11726624608415 |
10 | 3053531206301 |
11 | a77aa4840344 |
12 | 41396550a565 |
13 | 191c400442c4 |
14 | a7b125c9a69 |
15 | 5466910c0bb |
hex | 2c6f4a4929d |
3053531206301 has 2 divisors, whose sum is σ = 3053531206302. Its totient is φ = 3053531206300.
The previous prime is 3053531206267. The next prime is 3053531206339. The reversal of 3053531206301 is 1036021353503.
3053531206301 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3052966431076 + 564775225 = 1747274^2 + 23765^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3053531206301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3053531200301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1526765603150 + 1526765603151.
It is an arithmetic number, because the mean of its divisors is an integer number (1526765603151).
Almost surely, 23053531206301 is an apocalyptic number.
It is an amenable number.
3053531206301 is a deficient number, since it is larger than the sum of its proper divisors (1).
3053531206301 is an equidigital number, since it uses as much as digits as its factorization.
3053531206301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24300, while the sum is 32.
Adding to 3053531206301 its reverse (1036021353503), we get a palindrome (4089552559804).
The spelling of 3053531206301 in words is "three trillion, fifty-three billion, five hundred thirty-one million, two hundred six thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •