Base | Representation |
---|---|
bin | 1011010010011101… |
… | …1000100111100011 |
3 | 21211011220021221202 |
4 | 2310213120213203 |
5 | 22201214121311 |
6 | 1220404111415 |
7 | 135043321232 |
oct | 26447304743 |
9 | 7734807852 |
10 | 3030223331 |
11 | 1315533703 |
12 | 70699556b |
13 | 393a37075 |
14 | 20a632b19 |
15 | 12b063e3b |
hex | b49d89e3 |
3030223331 has 8 divisors (see below), whose sum is σ = 3041258640. Its totient is φ = 3019206528.
The previous prime is 3030223321. The next prime is 3030223333. The reversal of 3030223331 is 1333220303.
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 3030223331 - 26 = 3030223267 is a prime.
It is a super-2 number, since 2×30302233312 = 18364506871473471122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3030223333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 379280 + ... + 387186.
It is an arithmetic number, because the mean of its divisors is an integer number (380157330).
Almost surely, 23030223331 is an apocalyptic number.
3030223331 is a deficient number, since it is larger than the sum of its proper divisors (11035309).
3030223331 is an equidigital number, since it uses as much as digits as its factorization.
3030223331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9253.
The product of its (nonzero) digits is 972, while the sum is 20.
The square root of 3030223331 is about 55047.4643466890. The cubic root of 3030223331 is about 1447.0766836059.
Adding to 3030223331 its reverse (1333220303), we get a palindrome (4363443634).
The spelling of 3030223331 in words is "three billion, thirty million, two hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •