Base | Representation |
---|---|
bin | 100101010101011001101… |
… | …0111000000101111011000 |
3 | 200011112112011021001012100 |
4 | 1022222303113000233120 |
5 | 1133032144211333212 |
6 | 14525124002043400 |
7 | 1036500631154142 |
oct | 112526327005730 |
9 | 20145464231170 |
10 | 5131200105432 |
11 | 16a9147764665 |
12 | 6aa564649560 |
13 | 2b2b4079924b |
14 | 13a4cc3abc92 |
15 | 8d71aae1bdc |
hex | 4aab35c0bd8 |
5131200105432 has 192 divisors, whose sum is σ = 14026364352000. Its totient is φ = 1694574201600.
The previous prime is 5131200105377. The next prime is 5131200105433. The reversal of 5131200105432 is 2345010021315.
5131200105432 is a `hidden beast` number, since 5 + 1 + 3 + 120 + 0 + 105 + 432 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 5131200105396 and 5131200105405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5131200105433) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5035524619 + ... + 5035525637.
It is an arithmetic number, because the mean of its divisors is an integer number (73053981000).
Almost surely, 25131200105432 is an apocalyptic number.
It is an amenable number.
5131200105432 is an abundant number, since it is smaller than the sum of its proper divisors (8895164246568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5131200105432 is a wasteful number, since it uses less digits than its factorization.
5131200105432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2422 (or 2415 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 5131200105432 its reverse (2345010021315), we get a palindrome (7476210126747).
The spelling of 5131200105432 in words is "five trillion, one hundred thirty-one billion, two hundred million, one hundred five thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •