Base | Representation |
---|---|
bin | 11100001000001111… |
… | …010011111001001001 |
3 | 2212221220021111101001 |
4 | 130020033103321021 |
5 | 443323432034231 |
6 | 21513003055001 |
7 | 2116313166463 |
oct | 341017237111 |
9 | 85856244331 |
10 | 30203002441 |
11 | 11899897847 |
12 | 5a2ab11461 |
13 | 2b04460ba1 |
14 | 16673ad133 |
15 | bbb877b61 |
hex | 7083d3e49 |
30203002441 has 4 divisors (see below), whose sum is σ = 30263530000. Its totient is φ = 30142474884.
The previous prime is 30203002411. The next prime is 30203002499. The reversal of 30203002441 is 14420030203.
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: 14420030203 = 467 ⋅30878009.
It is a cyclic number.
It is not a de Polignac number, because 30203002441 - 25 = 30203002409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30203002411) 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 3 ways as a sum of consecutive naturals, for example, 30263031 + ... + 30264028.
It is an arithmetic number, because the mean of its divisors is an integer number (7565882500).
Almost surely, 230203002441 is an apocalyptic number.
It is an amenable number.
30203002441 is a deficient number, since it is larger than the sum of its proper divisors (60527559).
30203002441 is an equidigital number, since it uses as much as digits as its factorization.
30203002441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60527558.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 30203002441 its reverse (14420030203), we get a palindrome (44623032644).
The spelling of 30203002441 in words is "thirty billion, two hundred three million, two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •