Base | Representation |
---|---|
bin | 11100001010100101… |
… | …000100011001111011 |
3 | 2220001122011000110001 |
4 | 130022211010121323 |
5 | 443414004314403 |
6 | 21520524333431 |
7 | 2120300654662 |
oct | 341245043173 |
9 | 86048130401 |
10 | 30242260603 |
11 | 11909a71005 |
12 | 5a400a4277 |
13 | 2b0c627b79 |
14 | 166c6abdd9 |
15 | bc002ec1d |
hex | 70a94467b |
30242260603 has 4 divisors (see below), whose sum is σ = 30242611048. Its totient is φ = 30241910160.
The previous prime is 30242260549. The next prime is 30242260621. The reversal of 30242260603 is 30606224203.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 30606224203 = 75437 ⋅405719.
It is a cyclic number.
It is not a de Polignac number, because 30242260603 - 29 = 30242260091 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30242260693) 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, 55423 + ... + 252103.
It is an arithmetic number, because the mean of its divisors is an integer number (7560652762).
Almost surely, 230242260603 is an apocalyptic number.
30242260603 is a deficient number, since it is larger than the sum of its proper divisors (350445).
30242260603 is a wasteful number, since it uses less digits than its factorization.
30242260603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350444.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 30242260603 its reverse (30606224203), we get a palindrome (60848484806).
The spelling of 30242260603 in words is "thirty billion, two hundred forty-two million, two hundred sixty thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •