Base | Representation |
---|---|
bin | 10010000011111… |
… | …001010011000101 |
3 | 210010011112222010 |
4 | 102003321103011 |
5 | 1110032323023 |
6 | 50022324433 |
7 | 10336360014 |
oct | 2203712305 |
9 | 703145863 |
10 | 303011013 |
11 | 146050728 |
12 | 85589719 |
13 | 4aa13476 |
14 | 2c358a7b |
15 | 1b906093 |
hex | 120f94c5 |
303011013 has 4 divisors (see below), whose sum is σ = 404014688. Its totient is φ = 202007340.
The previous prime is 303010999. The next prime is 303011029. The reversal of 303011013 is 310110303.
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 not a de Polignac number, because 303011013 - 24 = 303010997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 303011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (303011083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50501833 + ... + 50501838.
It is an arithmetic number, because the mean of its divisors is an integer number (101003672).
Almost surely, 2303011013 is an apocalyptic number.
It is an amenable number.
303011013 is a deficient number, since it is larger than the sum of its proper divisors (101003675).
303011013 is a wasteful number, since it uses less digits than its factorization.
303011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101003674.
The product of its (nonzero) digits is 27, while the sum is 12.
The square root of 303011013 is about 17407.2115228143. The cubic root of 303011013 is about 671.6651335243.
Adding to 303011013 its reverse (310110303), we get a palindrome (613121316).
The spelling of 303011013 in words is "three hundred three million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •