Base | Representation |
---|---|
bin | 110000011011100000… |
… | …001000001001111000 |
3 | 11222020001002020100000 |
4 | 300123200020021320 |
5 | 1322444224430032 |
6 | 35520002113000 |
7 | 3520430220645 |
oct | 603340101170 |
9 | 158201066300 |
10 | 52001014392 |
11 | 20065242858 |
12 | a0b304b760 |
13 | 4b994b0a02 |
14 | 27343b0dcc |
15 | 15453a7e7c |
hex | c1b808278 |
52001014392 has 48 divisors (see below), whose sum is σ = 146052237240. Its totient is φ = 17333670816.
The previous prime is 52001014391. The next prime is 52001014393. The reversal of 52001014392 is 29341010025.
52001014392 is a `hidden beast` number, since 520 + 0 + 10 + 1 + 43 + 92 = 666.
It is an interprime number because it is at equal distance from previous prime (52001014391) and next prime (52001014393).
It is a super-2 number, since 2×520010143922 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52001014391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13372803 + ... + 13376690.
Almost surely, 252001014392 is an apocalyptic number.
It is an amenable number.
52001014392 is an abundant number, since it is smaller than the sum of its proper divisors (94051222848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52001014392 is a wasteful number, since it uses less digits than its factorization.
52001014392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26749514 (or 26749498 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The spelling of 52001014392 in words is "fifty-two billion, one million, fourteen thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •