Base | Representation |
---|---|
bin | 111001010011110111111010… |
… | …010100101110110110000001 |
3 | 1020001110011100102002220021011 |
4 | 321103313322110232312001 |
5 | 231014124310002121023 |
6 | 2252024101123000521 |
7 | 104043216620514442 |
oct | 7123677224566601 |
9 | 1201404312086234 |
10 | 252054355504513 |
11 | 73348719703281 |
12 | 243299a5809141 |
13 | aa8481546a133 |
14 | 46356d2a632c9 |
15 | 1e217a3b1b50d |
hex | e53dfa52ed81 |
252054355504513 has 4 divisors (see below), whose sum is σ = 252129349365508. Its totient is φ = 251979361643520.
The previous prime is 252054355504493. The next prime is 252054355504519. The reversal of 252054355504513 is 315405553450252.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 65117427394369 + 186936928110144 = 8069537^2 + 13672488^2 .
It is a cyclic number.
It is not a de Polignac number, because 252054355504513 - 25 = 252054355504481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (252054355504519) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37496925456 + ... + 37496932177.
It is an arithmetic number, because the mean of its divisors is an integer number (63032337341377).
Almost surely, 2252054355504513 is an apocalyptic number.
It is an amenable number.
252054355504513 is a deficient number, since it is larger than the sum of its proper divisors (74993860995).
252054355504513 is an equidigital number, since it uses as much as digits as its factorization.
252054355504513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74993860994.
The product of its (nonzero) digits is 9000000, while the sum is 49.
The spelling of 252054355504513 in words is "two hundred fifty-two trillion, fifty-four billion, three hundred fifty-five million, five hundred four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •