Base | Representation |
---|---|
bin | 1001011100010011… |
… | …01100011000101011 |
3 | 111002021201002212122 |
4 | 10232021230120223 |
5 | 40340212312311 |
6 | 2155003501455 |
7 | 236423000432 |
oct | 45611543053 |
9 | 14067632778 |
10 | 5069260331 |
11 | 2171513353 |
12 | b9582788b |
13 | 62a2cb835 |
14 | 361370119 |
15 | 1ea0880db |
hex | 12e26c62b |
5069260331 has 4 divisors (see below), whose sum is σ = 5069839632. Its totient is φ = 5068681032.
The previous prime is 5069260321. The next prime is 5069260333. The reversal of 5069260331 is 1330629605.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5069260331 - 230 = 3995518507 is a prime.
It is a super-2 number, since 2×50692603312 = 51394800606900459122, 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 = 5069260291 and 5069260300.
It is not an unprimeable number, because it can be changed into a prime (5069260333) 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, 276320 + ... + 294093.
It is an arithmetic number, because the mean of its divisors is an integer number (1267459908).
Almost surely, 25069260331 is an apocalyptic number.
5069260331 is a deficient number, since it is larger than the sum of its proper divisors (579301).
5069260331 is an equidigital number, since it uses as much as digits as its factorization.
5069260331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 579300.
The product of its (nonzero) digits is 29160, while the sum is 35.
The square root of 5069260331 is about 71198.7382683148. The cubic root of 5069260331 is about 1717.8353347012.
Adding to 5069260331 its reverse (1330629605), we get a palindrome (6399889936).
The spelling of 5069260331 in words is "five billion, sixty-nine million, two hundred sixty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •