Base | Representation |
---|---|
bin | 111010000110111110011100… |
… | …1000011111000001101100100 |
3 | 2111000202202100222201200111110 |
4 | 1310031330321003320031210 |
5 | 1013443342100330004220 |
6 | 5011030505320305020 |
7 | 212443035451363644 |
oct | 16415747103701544 |
9 | 2430682328650443 |
10 | 511132130313060 |
11 | 138953a12413613 |
12 | 493b09b8312170 |
13 | 18c28726131a29 |
14 | 9030cd9d98524 |
15 | 3e15abde6ebe0 |
hex | 1d0df390f8364 |
511132130313060 has 24 divisors (see below), whose sum is σ = 1431169964876736. Its totient is φ = 136301901416800.
The previous prime is 511132130313031. The next prime is 511132130313139. The reversal of 511132130313060 is 60313031231115.
It is a super-2 number, since 2×5111321303130602 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4259434419216 + ... + 4259434419335.
It is an arithmetic number, because the mean of its divisors is an integer number (59632081869864).
Almost surely, 2511132130313060 is an apocalyptic number.
It is an amenable number.
511132130313060 is an abundant number, since it is smaller than the sum of its proper divisors (920037834563676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
511132130313060 is a wasteful number, since it uses less digits than its factorization.
511132130313060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8518868838563 (or 8518868838561 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 30.
Adding to 511132130313060 its reverse (60313031231115), we get a palindrome (571445161544175).
The spelling of 511132130313060 in words is "five hundred eleven trillion, one hundred thirty-two billion, one hundred thirty million, three hundred thirteen thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •