Base | Representation |
---|---|
bin | 111011010001011001101000… |
… | …1010010100100010101100000 |
3 | 2112100222121212121100110002010 |
4 | 1312202303101102210111200 |
5 | 1021313434312331314131 |
6 | 5044501534303552520 |
7 | 214550042432334015 |
oct | 16642632122442540 |
9 | 2470877777313063 |
10 | 521361001432416 |
11 | 141137a60501052 |
12 | 4a5833085bb740 |
13 | 194bb192b1b1a2 |
14 | 92a601571770c |
15 | 4041be1cc2b46 |
hex | 1da2cd14a4560 |
521361001432416 has 48 divisors (see below), whose sum is σ = 1368651282224688. Its totient is φ = 173777012736000.
The previous prime is 521361001432409. The next prime is 521361001432417. The reversal of 521361001432416 is 614234100163125.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×5213610014324162 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (521361001432417) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154379265 + ... + 157720256.
It is an arithmetic number, because the mean of its divisors is an integer number (28513568379681).
Almost surely, 2521361001432416 is an apocalyptic number.
It is an amenable number.
521361001432416 is an abundant number, since it is smaller than the sum of its proper divisors (847290280792272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
521361001432416 is a wasteful number, since it uses less digits than its factorization.
521361001432416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312116935 (or 312116927 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 39.
The spelling of 521361001432416 in words is "five hundred twenty-one trillion, three hundred sixty-one billion, one million, four hundred thirty-two thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •