Base | Representation |
---|---|
bin | 111011100100101100000111… |
… | …0011011100101111100111110 |
3 | 2112201101001121210022021001001 |
4 | 1313021120032123211330332 |
5 | 1022140403110114431032 |
6 | 5054251444415440514 |
7 | 215242422254532322 |
oct | 16711301633457476 |
9 | 2481331553267031 |
10 | 524012022030142 |
11 | 141a6a28351a678 |
12 | 4a931059b2613a |
13 | 1965117734c149 |
14 | 935846252b982 |
15 | 408ab4ddb23e7 |
hex | 1dc960e6e5f3e |
524012022030142 has 4 divisors (see below), whose sum is σ = 786018033045216. Its totient is φ = 262006011015070.
The previous prime is 524012022030137. The next prime is 524012022030149. The reversal of 524012022030142 is 241030220210425.
It is a semiprime because it is the product of two primes.
It is a self number, because there is not a number n which added to its sum of digits gives 524012022030142.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (524012022030149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 131003005507534 + ... + 131003005507537.
It is an arithmetic number, because the mean of its divisors is an integer number (196504508261304).
Almost surely, 2524012022030142 is an apocalyptic number.
524012022030142 is a deficient number, since it is larger than the sum of its proper divisors (262006011015074).
524012022030142 is a wasteful number, since it uses less digits than its factorization.
524012022030142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262006011015073.
The product of its (nonzero) digits is 7680, while the sum is 28.
Adding to 524012022030142 its reverse (241030220210425), we get a palindrome (765042242240567).
The spelling of 524012022030142 in words is "five hundred twenty-four trillion, twelve billion, twenty-two million, thirty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •