Base | Representation |
---|---|
bin | 111010000110011010100010… |
… | …0100110001001100101010001 |
3 | 2111000111101022122121012020021 |
4 | 1310030311010212021211101 |
5 | 1013441111132143411103 |
6 | 5010531233231343441 |
7 | 212434335450262366 |
oct | 16414650446114521 |
9 | 2430441278535207 |
10 | 511055014435153 |
11 | 13892423a521111 |
12 | 49399a76381b81 |
13 | 18c2138669b846 |
14 | 902b2a22a046d |
15 | 3e13aa8ca5bbd |
hex | 1d0cd44989951 |
511055014435153 has 16 divisors (see below), whose sum is σ = 538461262535040. Its totient is φ = 484084410743296.
The previous prime is 511055014435099. The next prime is 511055014435157. The reversal of 511055014435153 is 351534410550115.
It is a cyclic number.
It is not a de Polignac number, because 511055014435153 - 29 = 511055014434641 is a prime.
It is a super-2 number, since 2×5110550144351532 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (511055014435157) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32539318 + ... + 45617071.
It is an arithmetic number, because the mean of its divisors is an integer number (33653828908440).
Almost surely, 2511055014435153 is an apocalyptic number.
It is an amenable number.
511055014435153 is a deficient number, since it is larger than the sum of its proper divisors (27406248099887).
511055014435153 is a wasteful number, since it uses less digits than its factorization.
511055014435153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78159176.
The product of its (nonzero) digits is 450000, while the sum is 43.
Adding to 511055014435153 its reverse (351534410550115), we get a palindrome (862589424985268).
The spelling of 511055014435153 in words is "five hundred eleven trillion, fifty-five billion, fourteen million, four hundred thirty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •