Base | Representation |
---|---|
bin | 111010010111011110100110… |
… | …0110110011001010010011100 |
3 | 2111022210120200000111102110100 |
4 | 1310232331030312121102130 |
5 | 1014243022104443231012 |
6 | 5015524444225341100 |
7 | 213065640453530553 |
oct | 16456751466312234 |
9 | 2438716600442410 |
10 | 513400205055132 |
11 | 13964889348a90a |
12 | 496b8495a97790 |
13 | 1906157c2c4625 |
14 | 90ac9b9980d9a |
15 | 3e54ab69858dc |
hex | 1d2ef4cd9949c |
513400205055132 has 72 divisors (see below), whose sum is σ = 1320364015850880. Its totient is φ = 168178233468960.
The previous prime is 513400205055121. The next prime is 513400205055211. The reversal of 513400205055132 is 231550502004315.
513400205055132 is a `hidden beast` number, since 5 + 1 + 3 + 4 + 0 + 0 + 20 + 50 + 551 + 32 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 527977782 + ... + 528949277.
It is an arithmetic number, because the mean of its divisors is an integer number (18338389109040).
Almost surely, 2513400205055132 is an apocalyptic number.
It is an amenable number.
513400205055132 is an abundant number, since it is smaller than the sum of its proper divisors (806963810795748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
513400205055132 is a wasteful number, since it uses less digits than its factorization.
513400205055132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1056927303 (or 1056927298 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
Adding to 513400205055132 its reverse (231550502004315), we get a palindrome (744950707059447).
The spelling of 513400205055132 in words is "five hundred thirteen trillion, four hundred billion, two hundred five million, fifty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •