Base | Representation |
---|---|
bin | 1000110100110101000… |
… | …01000111111001011001 |
3 | 1001222201022201101220021 |
4 | 10122122201013321121 |
5 | 14432013430210311 |
6 | 351150115230441 |
7 | 30623400123463 |
oct | 4323241077131 |
9 | 1058638641807 |
10 | 303240085081 |
11 | 10767013916a |
12 | 4a92a5a8421 |
13 | 2279819390b |
14 | 109695a3133 |
15 | 7d4bd79171 |
hex | 469a847e59 |
303240085081 has 4 divisors (see below), whose sum is σ = 308379747600. Its totient is φ = 298100422564.
The previous prime is 303240085051. The next prime is 303240085091. The reversal of 303240085081 is 180580042303.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 303240085081 - 211 = 303240083033 is a prime.
It is a super-2 number, since 2×3032400850812 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (303240085051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2569831171 + ... + 2569831288.
It is an arithmetic number, because the mean of its divisors is an integer number (77094936900).
Almost surely, 2303240085081 is an apocalyptic number.
It is an amenable number.
303240085081 is a deficient number, since it is larger than the sum of its proper divisors (5139662519).
303240085081 is an equidigital number, since it uses as much as digits as its factorization.
303240085081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5139662518.
The product of its (nonzero) digits is 23040, while the sum is 34.
The spelling of 303240085081 in words is "three hundred three billion, two hundred forty million, eighty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •