Base | Representation |
---|---|
bin | 100101010101100100000… |
… | …1110101010111001001011 |
3 | 200011120102120002201222120 |
4 | 1022223020032222321023 |
5 | 1133033403330142311 |
6 | 14525222430422323 |
7 | 1036512412232454 |
oct | 112531016527113 |
9 | 20146376081876 |
10 | 5131550240331 |
11 | 16a9307371149 |
12 | 6aa6419619a3 |
13 | 2b2b9819b968 |
14 | 13a522ab212b |
15 | 8d73b705706 |
hex | 4aac83aae4b |
5131550240331 has 8 divisors (see below), whose sum is σ = 6842597719440. Its totient is φ = 3420768127392.
The previous prime is 5131550240321. The next prime is 5131550240359. The reversal of 5131550240331 is 1330420551315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5131550240331 - 213 = 5131550232139 is a prime.
It is a super-2 number, since 2×51315502403312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5131550240292 and 5131550240301.
It is not an unprimeable number, because it can be changed into a prime (5131550240321) 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, 66296416 + ... + 66373773.
It is an arithmetic number, because the mean of its divisors is an integer number (855324714930).
Almost surely, 25131550240331 is an apocalyptic number.
5131550240331 is a deficient number, since it is larger than the sum of its proper divisors (1711047479109).
5131550240331 is a wasteful number, since it uses less digits than its factorization.
5131550240331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132683085.
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 5131550240331 its reverse (1330420551315), we get a palindrome (6461970791646).
The spelling of 5131550240331 in words is "five trillion, one hundred thirty-one billion, five hundred fifty million, two hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •