Base | Representation |
---|---|
bin | 11000000111011001000000… |
… | …11100000000001011110011 |
3 | 20221202200000002202012120101 |
4 | 30003230200130000023303 |
5 | 23422322433341243121 |
6 | 304441513341453231 |
7 | 14112220234424326 |
oct | 1403544034001363 |
9 | 227680002665511 |
10 | 53030505415411 |
11 | 15996124893987 |
12 | 5b45800b71217 |
13 | 23789a8247c34 |
14 | d14993b107bd |
15 | 61e6a2565491 |
hex | 303b207002f3 |
53030505415411 has 8 divisors (see below), whose sum is σ = 53412533742960. Its totient is φ = 52648484429568.
The previous prime is 53030505415397. The next prime is 53030505415439. The reversal of 53030505415411 is 11451450503035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53030505415411 is a prime.
It is a super-2 number, since 2×530305054154112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53030505415441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13099095 + ... + 16662751.
It is an arithmetic number, because the mean of its divisors is an integer number (6676566717870).
Almost surely, 253030505415411 is an apocalyptic number.
53030505415411 is a deficient number, since it is larger than the sum of its proper divisors (382028327549).
53030505415411 is a wasteful number, since it uses less digits than its factorization.
53030505415411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3670853.
The product of its (nonzero) digits is 90000, while the sum is 37.
Adding to 53030505415411 its reverse (11451450503035), we get a palindrome (64481955918446).
The spelling of 53030505415411 in words is "fifty-three trillion, thirty billion, five hundred five million, four hundred fifteen thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •