Base | Representation |
---|---|
bin | 1001100011110001… |
… | …11000001110010110 |
3 | 111020122200122100110 |
4 | 10301320320032112 |
5 | 41002240224423 |
6 | 2205123423450 |
7 | 241113644055 |
oct | 46170701626 |
9 | 14218618313 |
10 | 5131961238 |
11 | 21a3949488 |
12 | bb2824b86 |
13 | 63a2b2c71 |
14 | 36981239c |
15 | 200821193 |
hex | 131e38396 |
5131961238 has 8 divisors (see below), whose sum is σ = 10263922488. Its totient is φ = 1710653744.
The previous prime is 5131961147. The next prime is 5131961239. The reversal of 5131961238 is 8321691315.
It is a sphenic number, since it is the product of 3 distinct primes.
5131961238 is an admirable number.
It is a super-2 number, since 2×51319612382 = 52674052296668985288, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5131961196 and 5131961205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5131961239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 427663431 + ... + 427663442.
It is an arithmetic number, because the mean of its divisors is an integer number (1282990311).
Almost surely, 25131961238 is an apocalyptic number.
5131961238 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5131961238 is a wasteful number, since it uses less digits than its factorization.
5131961238 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 855326878.
The product of its digits is 38880, while the sum is 39.
The square root of 5131961238 is about 71637.7082129237. The cubic root of 5131961238 is about 1724.8888803868. Note that the first 5 decimals are identical.
The spelling of 5131961238 in words is "five billion, one hundred thirty-one million, nine hundred sixty-one thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •