Base | Representation |
---|---|
bin | 11100001010101011… |
… | …110010101011011001 |
3 | 2220001202110120000001 |
4 | 130022223302223121 |
5 | 443414432214001 |
6 | 21521030213001 |
7 | 2120321645113 |
oct | 341253625331 |
9 | 86052416001 |
10 | 30244023001 |
11 | 1190aa65135 |
12 | 5a407b4161 |
13 | 2b0cac40ca |
14 | 166ca0a3b3 |
15 | bc027c001 |
hex | 70aaf2ad9 |
30244023001 has 4 divisors (see below), whose sum is σ = 30244662400. Its totient is φ = 30243383604.
The previous prime is 30244022969. The next prime is 30244023013. The reversal of 30244023001 is 10032044203.
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.
It is a cyclic number.
It is not a de Polignac number, because 30244023001 - 25 = 30244022969 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30244023001.
It is not an unprimeable number, because it can be changed into a prime (30244023041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 242541 + ... + 345418.
It is an arithmetic number, because the mean of its divisors is an integer number (7561165600).
Almost surely, 230244023001 is an apocalyptic number.
It is an amenable number.
30244023001 is a deficient number, since it is larger than the sum of its proper divisors (639399).
30244023001 is an equidigital number, since it uses as much as digits as its factorization.
30244023001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639398.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 30244023001 its reverse (10032044203), we get a palindrome (40276067204).
The spelling of 30244023001 in words is "thirty billion, two hundred forty-four million, twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •