Base | Representation |
---|---|
bin | 1011010010101011… |
… | …0110001110010111 |
3 | 21211020121102002021 |
4 | 2310222312032113 |
5 | 22201432143111 |
6 | 1220435354011 |
7 | 135054121465 |
oct | 26452661627 |
9 | 7736542067 |
10 | 3031131031 |
11 | 1315aa3675 |
12 | 707152907 |
13 | 393c94276 |
14 | 20a7cb835 |
15 | 12b192d71 |
hex | b4ab6397 |
3031131031 has 4 divisors (see below), whose sum is σ = 3036672952. Its totient is φ = 3025589112.
The previous prime is 3031131029. The next prime is 3031131041. The reversal of 3031131031 is 1301311303.
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 3031131031 - 21 = 3031131029 is a prime.
It is a super-2 number, since 2×30311310312 = 18375510654182245922, 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 = 3031130996 and 3031131014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3031131041) 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, 2770140 + ... + 2771233.
It is an arithmetic number, because the mean of its divisors is an integer number (759168238).
Almost surely, 23031131031 is an apocalyptic number.
3031131031 is a deficient number, since it is larger than the sum of its proper divisors (5541921).
3031131031 is an equidigital number, since it uses as much as digits as its factorization.
3031131031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5541920.
The product of its (nonzero) digits is 81, while the sum is 16.
The square root of 3031131031 is about 55055.7084324596. The cubic root of 3031131031 is about 1447.2211592469.
Adding to 3031131031 its reverse (1301311303), we get a palindrome (4332442334).
The spelling of 3031131031 in words is "three billion, thirty-one million, one hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •