Base | Representation |
---|---|
bin | 110000100011100101… |
… | …001010000000100011 |
3 | 11222120111010011211110 |
4 | 300203211022000203 |
5 | 1323233424103220 |
6 | 35541243114403 |
7 | 3523664236524 |
oct | 604345120043 |
9 | 158514104743 |
10 | 52136550435 |
11 | 201247a6012 |
12 | a130512a03 |
13 | 4bbb5b7258 |
14 | 27483b284b |
15 | 155222bbe0 |
hex | c2394a023 |
52136550435 has 32 divisors (see below), whose sum is σ = 83913984000. Its totient is φ = 27641438208.
The previous prime is 52136550391. The next prime is 52136550451. The reversal of 52136550435 is 53405563125.
It is not a de Polignac number, because 52136550435 - 213 = 52136542243 is a prime.
It is a super-2 number, since 2×521365504352 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 52136550393 and 52136550402.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1910094 + ... + 1937196.
It is an arithmetic number, because the mean of its divisors is an integer number (2622312000).
Almost surely, 252136550435 is an apocalyptic number.
52136550435 is a deficient number, since it is larger than the sum of its proper divisors (31777433565).
52136550435 is a wasteful number, since it uses less digits than its factorization.
52136550435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27867.
The product of its (nonzero) digits is 270000, while the sum is 39.
The spelling of 52136550435 in words is "fifty-two billion, one hundred thirty-six million, five hundred fifty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •