Base | Representation |
---|---|
bin | 111011001110110111001011… |
… | …1000100001001110010001100 |
3 | 2112022202021101022101102100010 |
4 | 1312131232113010021302030 |
5 | 1021242230321322133030 |
6 | 5044033400322033220 |
7 | 214512612223105434 |
oct | 16635562704116214 |
9 | 2468667338342303 |
10 | 521012132224140 |
11 | 141013005978317 |
12 | 4a527784aa8810 |
13 | 194943055c19bb |
14 | 929319c11b2c4 |
15 | 4037ac41886b0 |
hex | 1d9db97109c8c |
521012132224140 has 24 divisors (see below), whose sum is σ = 1458833970227760. Its totient is φ = 138936568593088.
The previous prime is 521012132224117. The next prime is 521012132224159. The reversal of 521012132224140 is 41422231210125.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 521012132224098 and 521012132224107.
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, 4341767768475 + ... + 4341767768594.
It is an arithmetic number, because the mean of its divisors is an integer number (60784748759490).
Almost surely, 2521012132224140 is an apocalyptic number.
It is an amenable number.
521012132224140 is an abundant number, since it is smaller than the sum of its proper divisors (937821838003620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
521012132224140 is a wasteful number, since it uses less digits than its factorization.
521012132224140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8683535537081 (or 8683535537079 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 521012132224140 its reverse (41422231210125), we get a palindrome (562434363434265).
The spelling of 521012132224140 in words is "five hundred twenty-one trillion, twelve billion, one hundred thirty-two million, two hundred twenty-four thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •