Base | Representation |
---|---|
bin | 101100011011110000100… |
… | …000110101110010111001 |
3 | 101210220112000022020211112 |
4 | 230123300200311302321 |
5 | 400011442222432303 |
6 | 10254424022010105 |
7 | 433414430041613 |
oct | 54336040656271 |
9 | 11726460266745 |
10 | 3053461920953 |
11 | a77a69718224 |
12 | 413946276935 |
13 | 191c2b895b62 |
14 | a7b07311db3 |
15 | 54662ec30d8 |
hex | 2c6f0835cb9 |
3053461920953 has 2 divisors, whose sum is σ = 3053461920954. Its totient is φ = 3053461920952.
The previous prime is 3053461920937. The next prime is 3053461920961. The reversal of 3053461920953 is 3590291643503.
3053461920953 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 strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2390527253689 + 662934667264 = 1546133^2 + 814208^2 .
It is an emirp because it is prime and its reverse (3590291643503) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3053461920953 - 24 = 3053461920937 is a prime.
It is not a weakly prime, because it can be changed into another prime (3053461920913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1526730960476 + 1526730960477.
It is an arithmetic number, because the mean of its divisors is an integer number (1526730960477).
Almost surely, 23053461920953 is an apocalyptic number.
It is an amenable number.
3053461920953 is a deficient number, since it is larger than the sum of its proper divisors (1).
3053461920953 is an equidigital number, since it uses as much as digits as its factorization.
3053461920953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2624400, while the sum is 50.
The spelling of 3053461920953 in words is "three trillion, fifty-three billion, four hundred sixty-one million, nine hundred twenty thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •