Base | Representation |
---|---|
bin | 10111101010100101111111… |
… | …11101111101110000001001 |
3 | 20211021002000212101020002100 |
4 | 23311102333331331300021 |
5 | 23310120024334402223 |
6 | 302403154211224013 |
7 | 13650561411122502 |
oct | 1365227775756011 |
9 | 224232025336070 |
10 | 52041044450313 |
11 | 15644534980996 |
12 | 5a05aa05a8009 |
13 | 23065ac53b129 |
14 | cbcb2b263ba9 |
15 | 603a91186043 |
hex | 2f54bff7dc09 |
52041044450313 has 12 divisors (see below), whose sum is σ = 75174525522928. Its totient is φ = 34692124410360.
The previous prime is 52041044450309. The next prime is 52041044450333. The reversal of 52041044450313 is 31305444014025.
52041044450313 is a `hidden beast` number, since 5 + 2 + 0 + 4 + 104 + 44 + 503 + 1 + 3 = 666.
It is not a de Polignac number, because 52041044450313 - 22 = 52041044450309 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (52041044450303) 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 11 ways as a sum of consecutive naturals, for example, 158595595 + ... + 158923392.
Almost surely, 252041044450313 is an apocalyptic number.
It is an amenable number.
52041044450313 is a deficient number, since it is larger than the sum of its proper divisors (23133481072615).
52041044450313 is a wasteful number, since it uses less digits than its factorization.
52041044450313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317537204 (or 317537201 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 36.
Adding to 52041044450313 its reverse (31305444014025), we get a palindrome (83346488464338).
The spelling of 52041044450313 in words is "fifty-two trillion, forty-one billion, forty-four million, four hundred fifty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •