Base | Representation |
---|---|
bin | 100101010101010110101… |
… | …1010110010111111110100 |
3 | 200011112021012201020021101 |
4 | 1022222231122302333310 |
5 | 1133031443202400140 |
6 | 14525110041455444 |
7 | 1036465311032122 |
oct | 112525532627764 |
9 | 20145235636241 |
10 | 5131100434420 |
11 | 16a90a6478324 |
12 | 6aa5371a1584 |
13 | 2b2b25c3c40c |
14 | 13a4bd064912 |
15 | 8d711ea499a |
hex | 4aaad6b2ff4 |
5131100434420 has 12 divisors (see below), whose sum is σ = 10775310912324. Its totient is φ = 2052440173760.
The previous prime is 5131100434351. The next prime is 5131100434459. The reversal of 5131100434420 is 244340011315.
It can be written as a sum of positive squares in 2 ways, for example, as 3272900701456 + 1858199732964 = 1809116^2 + 1363158^2 .
It is a super-2 number, since 2×51311004344202 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128277510841 + ... + 128277510880.
It is an arithmetic number, because the mean of its divisors is an integer number (897942576027).
Almost surely, 25131100434420 is an apocalyptic number.
It is an amenable number.
5131100434420 is an abundant number, since it is smaller than the sum of its proper divisors (5644210477904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5131100434420 is a wasteful number, since it uses less digits than its factorization.
5131100434420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256555021730 (or 256555021728 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 5131100434420 its reverse (244340011315), we get a palindrome (5375440445735).
The spelling of 5131100434420 in words is "five trillion, one hundred thirty-one billion, one hundred million, four hundred thirty-four thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •