Base | Representation |
---|---|
bin | 1001010111110001… |
… | …11010100001000011 |
3 | 110222122021220010222 |
4 | 10223320322201003 |
5 | 40301003313311 |
6 | 2151130213255 |
7 | 235452256331 |
oct | 45370724103 |
9 | 13878256128 |
10 | 5031307331 |
11 | 2152050736 |
12 | b84b8422b |
13 | 6224a093b |
14 | 35a2d0b51 |
15 | 1e6a8cadb |
hex | 12be3a843 |
5031307331 has 8 divisors (see below), whose sum is σ = 5396040720. Its totient is φ = 4676566752.
The previous prime is 5031307319. The next prime is 5031307349. The reversal of 5031307331 is 1337031305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5031307331 - 210 = 5031306307 is a prime.
It is a super-2 number, since 2×50313073312 = 50628106917948687122, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5031307331.
It is not an unprimeable number, because it can be changed into a prime (5031307361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2497160 + ... + 2499173.
It is an arithmetic number, because the mean of its divisors is an integer number (674505090).
Almost surely, 25031307331 is an apocalyptic number.
5031307331 is a deficient number, since it is larger than the sum of its proper divisors (364733389).
5031307331 is a wasteful number, since it uses less digits than its factorization.
5031307331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4996405.
The product of its (nonzero) digits is 2835, while the sum is 26.
The square root of 5031307331 is about 70931.7089248525. The cubic root of 5031307331 is about 1713.5375089847.
Adding to 5031307331 its reverse (1337031305), we get a palindrome (6368338636).
The spelling of 5031307331 in words is "five billion, thirty-one million, three hundred seven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •