Base | Representation |
---|---|
bin | 10010000011111… |
… | …110111111100101 |
3 | 210010012201222010 |
4 | 102003332333211 |
5 | 1110034044331 |
6 | 50023024433 |
7 | 10336515021 |
oct | 2203767745 |
9 | 703181863 |
10 | 303034341 |
11 | 146067205 |
12 | 8559b119 |
13 | 4aa20c7c |
14 | 2c363381 |
15 | 1b90ce46 |
hex | 120fefe5 |
303034341 has 4 divisors (see below), whose sum is σ = 404045792. Its totient is φ = 202022892.
The previous prime is 303034327. The next prime is 303034349. The reversal of 303034341 is 143430303.
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, and also an emirpimes, since its reverse is a distinct semiprime: 143430303 = 3 ⋅47810101.
It is not a de Polignac number, because 303034341 - 210 = 303033317 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (303034349) 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, 50505721 + ... + 50505726.
It is an arithmetic number, because the mean of its divisors is an integer number (101011448).
Almost surely, 2303034341 is an apocalyptic number.
It is an amenable number.
303034341 is a deficient number, since it is larger than the sum of its proper divisors (101011451).
303034341 is a wasteful number, since it uses less digits than its factorization.
303034341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101011450.
The product of its (nonzero) digits is 1296, while the sum is 21.
The square root of 303034341 is about 17407.8815770329. The cubic root of 303034341 is about 671.6823696438.
Adding to 303034341 its reverse (143430303), we get a palindrome (446464644).
The spelling of 303034341 in words is "three hundred three million, thirty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •