Base | Representation |
---|---|
bin | 111010010100100100010011… |
… | …0101001010100100100111110 |
3 | 2111021101100000020201100011102 |
4 | 1310221020212221110210332 |
5 | 1014214443232311311410 |
6 | 5015021001322253102 |
7 | 213025015335032225 |
oct | 16451104651244476 |
9 | 2437340006640142 |
10 | 513000132135230 |
11 | 139504152782733 |
12 | 49652a42357192 |
13 | 1903292183471c |
14 | 90974a5c39cbc |
15 | 3e4949d9862a5 |
hex | 1d29226a5493e |
513000132135230 has 8 divisors (see below), whose sum is σ = 923400237843432. Its totient is φ = 205200052854088.
The previous prime is 513000132135221. The next prime is 513000132135241. The reversal of 513000132135230 is 32531231000315.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 513000132135193 and 513000132135202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25650006606752 + ... + 25650006606771.
It is an arithmetic number, because the mean of its divisors is an integer number (115425029730429).
Almost surely, 2513000132135230 is an apocalyptic number.
513000132135230 is a deficient number, since it is larger than the sum of its proper divisors (410400105708202).
513000132135230 is a wasteful number, since it uses less digits than its factorization.
513000132135230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51300013213530.
The product of its (nonzero) digits is 8100, while the sum is 29.
Adding to 513000132135230 its reverse (32531231000315), we get a palindrome (545531363135545).
The spelling of 513000132135230 in words is "five hundred thirteen trillion, one hundred thirty-two million, one hundred thirty-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •