Base | Representation |
---|---|
bin | 11000010000011010011100… |
… | …10110011000110000010011 |
3 | 20222212022012002100111112021 |
4 | 30020031032112120300103 |
5 | 23442412332403343220 |
6 | 305240143223312311 |
7 | 14143503434336656 |
oct | 1410151626306023 |
9 | 228768162314467 |
10 | 53340513340435 |
11 | 15aa56482183a2 |
12 | 5b958b9bab697 |
13 | 239bcb15aa269 |
14 | d259a207989d |
15 | 62779864a4aa |
hex | 30834e598c13 |
53340513340435 has 8 divisors (see below), whose sum is σ = 64008677223216. Its totient is φ = 42672369862560.
The previous prime is 53340513340427. The next prime is 53340513340469. The reversal of 53340513340435 is 53404331504335.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53340513340435 - 23 = 53340513340427 is a prime.
It is a super-2 number, since 2×533405133404352 (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 = 53340513340391 and 53340513340400.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1403940 + ... + 10423630.
It is an arithmetic number, because the mean of its divisors is an integer number (8001084652902).
Almost surely, 253340513340435 is an apocalyptic number.
53340513340435 is a deficient number, since it is larger than the sum of its proper divisors (10668163882781).
53340513340435 is a wasteful number, since it uses less digits than its factorization.
53340513340435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10202453.
The product of its (nonzero) digits is 1944000, while the sum is 43.
The spelling of 53340513340435 in words is "fifty-three trillion, three hundred forty billion, five hundred thirteen million, three hundred forty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •