Base | Representation |
---|---|
bin | 111010010110000111000100… |
… | …0010101011111011100100110 |
3 | 2111022010121110022220212202210 |
4 | 1310230032020111133130212 |
5 | 1014231432113433022132 |
6 | 5015302235141544250 |
7 | 213046234231302426 |
oct | 16454161025373446 |
9 | 2438117408825683 |
10 | 513212224501542 |
11 | 13958609a3526a5 |
12 | 49687b73715086 |
13 | 19049922188427 |
14 | 90a3865d00486 |
15 | 3e4ec63823bcc |
hex | 1d2c38855f726 |
513212224501542 has 32 divisors (see below), whose sum is σ = 1029715277199840. Its totient is φ = 170522282361600.
The previous prime is 513212224501523. The next prime is 513212224501579. The reversal of 513212224501542 is 245105422212315.
It is a happy number.
It is a super-2 number, since 2×5132122245015422 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 513212224501542.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 171648792 + ... + 174613092.
It is an arithmetic number, because the mean of its divisors is an integer number (32178602412495).
Almost surely, 2513212224501542 is an apocalyptic number.
513212224501542 is an abundant number, since it is smaller than the sum of its proper divisors (516503052698298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
513212224501542 is a wasteful number, since it uses less digits than its factorization.
513212224501542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3056808.
The product of its (nonzero) digits is 192000, while the sum is 39.
Adding to 513212224501542 its reverse (245105422212315), we get a palindrome (758317646713857).
The spelling of 513212224501542 in words is "five hundred thirteen trillion, two hundred twelve billion, two hundred twenty-four million, five hundred one thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •