Base | Representation |
---|---|
bin | 1001010111101000… |
… | …00110100110110011 |
3 | 110222112220211002212 |
4 | 10223310012212303 |
5 | 40300142434011 |
6 | 2151043202335 |
7 | 235435454345 |
oct | 45364064663 |
9 | 13875824085 |
10 | 5030046131 |
11 | 215136a120 |
12 | b846763ab |
13 | 62214b876 |
14 | 35a083295 |
15 | 1e68de08b |
hex | 12bd069b3 |
5030046131 has 16 divisors (see below), whose sum is σ = 5618688768. Its totient is φ = 4463440800.
The previous prime is 5030046127. The next prime is 5030046167. The reversal of 5030046131 is 1316400305.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 5030046131 - 22 = 5030046127 is a prime.
It is a super-2 number, since 2×50300461312 = 50602728159976138322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5030046097 and 5030046106.
It is not an unprimeable number, because it can be changed into a prime (5030046101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1010210 + ... + 1015176.
It is an arithmetic number, because the mean of its divisors is an integer number (351168048).
Almost surely, 25030046131 is an apocalyptic number.
5030046131 is a deficient number, since it is larger than the sum of its proper divisors (588642637).
5030046131 is a wasteful number, since it uses less digits than its factorization.
5030046131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7162.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 5030046131 is about 70922.8181264676. The cubic root of 5030046131 is about 1713.3943192883.
Adding to 5030046131 its reverse (1316400305), we get a palindrome (6346446436).
The spelling of 5030046131 in words is "five billion, thirty million, forty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •