Base | Representation |
---|---|
bin | 1011010010101011… |
… | …0110000011011010 |
3 | 21211020121101010022 |
4 | 2310222312003122 |
5 | 22201432132310 |
6 | 1220435350442 |
7 | 135054116444 |
oct | 26452660332 |
9 | 7736541108 |
10 | 3031130330 |
11 | 1315aa3098 |
12 | 707152422 |
13 | 393c93b57 |
14 | 20a7cb494 |
15 | 12b192a55 |
hex | b4ab60da |
3031130330 has 8 divisors (see below), whose sum is σ = 5456034612. Its totient is φ = 1212452128.
The previous prime is 3031130299. The next prime is 3031130339. The reversal of 3031130330 is 330311303.
3031130330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 3017195041 + 13935289 = 54929^2 + 3733^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×30311303304 (a number of 39 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3031130299 and 3031130308.
It is not an unprimeable number, because it can be changed into a prime (3031130339) 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, 151556507 + ... + 151556526.
Almost surely, 23031130330 is an apocalyptic number.
3031130330 is a deficient number, since it is larger than the sum of its proper divisors (2424904282).
3031130330 is a wasteful number, since it uses less digits than its factorization.
3031130330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 303113040.
The product of its (nonzero) digits is 243, while the sum is 17.
The square root of 3031130330 is about 55055.7020661802. The cubic root of 3031130330 is about 1447.2210476821.
Adding to 3031130330 its reverse (330311303), we get a palindrome (3361441633).
The spelling of 3031130330 in words is "three billion, thirty-one million, one hundred thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •