Base | Representation |
---|---|
bin | 1001111011011001… |
… | …00001111111010111 |
3 | 111202110102122110110 |
4 | 10331230201333113 |
5 | 41403443113111 |
6 | 2240521254103 |
7 | 246040454244 |
oct | 47554417727 |
9 | 14673378413 |
10 | 5330051031 |
11 | 2295747258 |
12 | 1049034333 |
13 | 66c34b966 |
14 | 387c585cb |
15 | 212dee5a6 |
hex | 13db21fd7 |
5330051031 has 4 divisors (see below), whose sum is σ = 7106734712. Its totient is φ = 3553367352.
The previous prime is 5330051003. The next prime is 5330051033. The reversal of 5330051031 is 1301500335.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5330051031 - 27 = 5330050903 is a prime.
It is a super-2 number, since 2×53300510312 = 56818887986128325922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5330050989 and 5330051007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5330051033) 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, 888341836 + ... + 888341841.
It is an arithmetic number, because the mean of its divisors is an integer number (1776683678).
Almost surely, 25330051031 is an apocalyptic number.
5330051031 is a deficient number, since it is larger than the sum of its proper divisors (1776683681).
5330051031 is a wasteful number, since it uses less digits than its factorization.
5330051031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1776683680.
The product of its (nonzero) digits is 675, while the sum is 21.
The square root of 5330051031 is about 73007.1984875464. The cubic root of 5330051031 is about 1746.8024365202.
Adding to 5330051031 its reverse (1301500335), we get a palindrome (6631551366).
The spelling of 5330051031 in words is "five billion, three hundred thirty million, fifty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •