Base | Representation |
---|---|
bin | 1001010101101110… |
… | …10110111011110111 |
3 | 110221102221210121210 |
4 | 10222313112323313 |
5 | 40232103402411 |
6 | 2145314012503 |
7 | 235153223106 |
oct | 45267267367 |
9 | 13842853553 |
10 | 5014122231 |
11 | 2143383278 |
12 | b7b277133 |
13 | 61ba64841 |
14 | 357cda03d |
15 | 1e52e5ca6 |
hex | 12add6ef7 |
5014122231 has 4 divisors (see below), whose sum is σ = 6685496312. Its totient is φ = 3342748152.
The previous prime is 5014122227. The next prime is 5014122233. The reversal of 5014122231 is 1322214105.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5014122231 - 22 = 5014122227 is a prime.
It is a super-2 number, since 2×50141222312 = 50282843494816834722, 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 = 5014122198 and 5014122207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5014122233) 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, 835687036 + ... + 835687041.
It is an arithmetic number, because the mean of its divisors is an integer number (1671374078).
Almost surely, 25014122231 is an apocalyptic number.
5014122231 is a deficient number, since it is larger than the sum of its proper divisors (1671374081).
5014122231 is a wasteful number, since it uses less digits than its factorization.
5014122231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1671374080.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 5014122231 is about 70810.4669593415. The cubic root of 5014122231 is about 1711.5843450358.
Adding to 5014122231 its reverse (1322214105), we get a palindrome (6336336336).
The spelling of 5014122231 in words is "five billion, fourteen million, one hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •