Base | Representation |
---|---|
bin | 1110101001010001… |
… | …1000110101001011 |
3 | 101010222021022121100 |
4 | 3222110120311023 |
5 | 31022342310011 |
6 | 1450031312443 |
7 | 166263521526 |
oct | 35224306513 |
9 | 11128238540 |
10 | 3931213131 |
11 | 173808167a |
12 | 91867b723 |
13 | 4a85b9121 |
14 | 294169bbd |
15 | 1801d8d56 |
hex | ea518d4b |
3931213131 has 6 divisors (see below), whose sum is σ = 5678418980. Its totient is φ = 2620808748.
The previous prime is 3931213109. The next prime is 3931213157. The reversal of 3931213131 is 1313121393.
3931213131 is a `hidden beast` number, since 39 + 312 + 1 + 313 + 1 = 666.
3931213131 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3931213131 - 26 = 3931213067 is a prime.
It is a super-2 number, since 2×39312131312 = 30908873362693646322, 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 = 3931213095 and 3931213104.
It is not an unprimeable number, because it can be changed into a prime (3931263131) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 218400721 + ... + 218400738.
Almost surely, 23931213131 is an apocalyptic number.
3931213131 is a deficient number, since it is larger than the sum of its proper divisors (1747205849).
3931213131 is a wasteful number, since it uses less digits than its factorization.
3931213131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 436801465 (or 436801462 counting only the distinct ones).
The product of its digits is 1458, while the sum is 27.
The square root of 3931213131 is about 62699.3870065729. The cubic root of 3931213131 is about 1578.2490257907.
The spelling of 3931213131 in words is "three billion, nine hundred thirty-one million, two hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •