Base | Representation |
---|---|
bin | 11100001010100110… |
… | …110100100010011101 |
3 | 2220001200000100111002 |
4 | 130022212310202131 |
5 | 443414114014101 |
6 | 21520542240045 |
7 | 2120304610022 |
oct | 341246644235 |
9 | 86050010432 |
10 | 30242719901 |
11 | 1190a255099 |
12 | 5a40286025 |
13 | 2b0c758c44 |
14 | 166c78b549 |
15 | bc00c0d6b |
hex | 70a9b489d |
30242719901 has 4 divisors (see below), whose sum is σ = 30243215904. Its totient is φ = 30242223900.
The previous prime is 30242719883. The next prime is 30242719943. The reversal of 30242719901 is 10991724203.
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: 10991724203 = 8863 ⋅1240181.
It is a cyclic number.
It is not a de Polignac number, because 30242719901 - 230 = 29168978077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30242719961) 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, 141215 + ... + 283596.
It is an arithmetic number, because the mean of its divisors is an integer number (7560803976).
Almost surely, 230242719901 is an apocalyptic number.
It is an amenable number.
30242719901 is a deficient number, since it is larger than the sum of its proper divisors (496003).
30242719901 is an equidigital number, since it uses as much as digits as its factorization.
30242719901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496002.
The product of its (nonzero) digits is 27216, while the sum is 38.
The spelling of 30242719901 in words is "thirty billion, two hundred forty-two million, seven hundred nineteen thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •