Base | Representation |
---|---|
bin | 100101100000101011100… |
… | …1010111010000010000011 |
3 | 200020212001022100101012001 |
4 | 1023001113022322002003 |
5 | 1133431301321412011 |
6 | 14544211351444431 |
7 | 1041316123302604 |
oct | 113012712720203 |
9 | 20225038311161 |
10 | 5155423232131 |
11 | 1708448016237 |
12 | 6b31a4986717 |
13 | 2b5201089203 |
14 | 13b7494c9dab |
15 | 8e1874a97c1 |
hex | 4b0572ba083 |
5155423232131 has 8 divisors (see below), whose sum is σ = 5427009205200. Its totient is φ = 4883862049920.
The previous prime is 5155423232119. The next prime is 5155423232137. The reversal of 5155423232131 is 1312323245515.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5155423232131 is a prime.
It is a super-2 number, since 2×51554232321312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5155423232137) 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, 5770090 + ... + 6603391.
It is an arithmetic number, because the mean of its divisors is an integer number (678376150650).
Almost surely, 25155423232131 is an apocalyptic number.
5155423232131 is a deficient number, since it is larger than the sum of its proper divisors (271585973069).
5155423232131 is a wasteful number, since it uses less digits than its factorization.
5155423232131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12395429.
The product of its digits is 108000, while the sum is 37.
Adding to 5155423232131 its reverse (1312323245515), we get a palindrome (6467746477646).
The spelling of 5155423232131 in words is "five trillion, one hundred fifty-five billion, four hundred twenty-three million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.741 sec. • engine limits •