Base | Representation |
---|---|
bin | 110000011011110000… |
… | …001110011011100001 |
3 | 11222020100000122002122 |
4 | 300123300032123201 |
5 | 1323001320000101 |
6 | 35520232354025 |
7 | 3520511125121 |
oct | 603360163341 |
9 | 158210018078 |
10 | 52005234401 |
11 | 2006766536a |
12 | a0b4545915 |
13 | 4b9a32a763 |
14 | 2734b8cc81 |
15 | 154593d51b |
hex | c1bc0e6e1 |
52005234401 has 4 divisors (see below), whose sum is σ = 52064534292. Its totient is φ = 51945934512.
The previous prime is 52005234377. The next prime is 52005234439. The reversal of 52005234401 is 10443250025.
It is a happy number.
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 46332132001 + 5673102400 = 215249^2 + 75320^2 .
It is a cyclic number.
It is not a de Polignac number, because 52005234401 - 214 = 52005218017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52005234481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29648630 + ... + 29650383.
It is an arithmetic number, because the mean of its divisors is an integer number (13016133573).
Almost surely, 252005234401 is an apocalyptic number.
It is an amenable number.
52005234401 is a deficient number, since it is larger than the sum of its proper divisors (59299891).
52005234401 is an equidigital number, since it uses as much as digits as its factorization.
52005234401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59299890.
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 52005234401 its reverse (10443250025), we get a palindrome (62448484426).
The spelling of 52005234401 in words is "fifty-two billion, five million, two hundred thirty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •