Base | Representation |
---|---|
bin | 11100001101101010… |
… | …101000000110110011 |
3 | 2220012020121011001100 |
4 | 130031222220012303 |
5 | 444020234033303 |
6 | 21530014335443 |
7 | 2121500112105 |
oct | 341552500663 |
9 | 86166534040 |
10 | 30294049203 |
11 | 11936223600 |
12 | 5a554ba583 |
13 | 2b1a28b402 |
14 | 167550d575 |
15 | bc485e8a3 |
hex | 70daa81b3 |
30294049203 has 72 divisors (see below), whose sum is σ = 48838136256. Its totient is φ = 18079649280.
The previous prime is 30294049171. The next prime is 30294049229.
30294049203 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 30294049203 - 25 = 30294049171 is a prime.
It is a super-2 number, since 2×302940492032 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (30294049243) 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 71 ways as a sum of consecutive naturals, for example, 21288150 + ... + 21289572.
It is an arithmetic number, because the mean of its divisors is an integer number (678307448).
Almost surely, 230294049203 is an apocalyptic number.
30294049203 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
30294049203 is a deficient number, since it is larger than the sum of its proper divisors (18544087053).
30294049203 is a wasteful number, since it uses less digits than its factorization.
30294049203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1737 (or 1723 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 36.
The spelling of 30294049203 in words is "thirty billion, two hundred ninety-four million, forty-nine thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •