Base | Representation |
---|---|
bin | 10111101010111110101000… |
… | …00010000111011111000011 |
3 | 20211022100011022000202221212 |
4 | 23311133110002013133003 |
5 | 23310324114043004323 |
6 | 302413222154440335 |
7 | 13651540144244654 |
oct | 1365372402073703 |
9 | 224270138022855 |
10 | 52054265984963 |
11 | 1564a0aa107630 |
12 | 5a085704330ab |
13 | 2307908796c08 |
14 | cbd6231b952b |
15 | 6040b6c97b78 |
hex | 2f57d40877c3 |
52054265984963 has 4 divisors (see below), whose sum is σ = 56786471983608. Its totient is φ = 47322059986320.
The previous prime is 52054265984947. The next prime is 52054265984989. The reversal of 52054265984963 is 36948956245025.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 52054265984963 - 24 = 52054265984947 is a prime.
It is a super-2 number, since 2×520542659849632 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52054265984893 and 52054265984902.
It is not an unprimeable number, because it can be changed into a prime (52054265984263) 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, 2366102999306 + ... + 2366102999327.
It is an arithmetic number, because the mean of its divisors is an integer number (14196617995902).
Almost surely, 252054265984963 is an apocalyptic number.
52054265984963 is a deficient number, since it is larger than the sum of its proper divisors (4732205998645).
52054265984963 is a wasteful number, since it uses less digits than its factorization.
52054265984963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4732205998644.
The product of its (nonzero) digits is 559872000, while the sum is 68.
The spelling of 52054265984963 in words is "fifty-two trillion, fifty-four billion, two hundred sixty-five million, nine hundred eighty-four thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •