Base | Representation |
---|---|
bin | 11100010101110001… |
… | …010101000101000001 |
3 | 2220112201110101101222 |
4 | 130111301111011001 |
5 | 444310041232001 |
6 | 21551313004425 |
7 | 2125040636066 |
oct | 342561250501 |
9 | 86481411358 |
10 | 30430024001 |
11 | 119a5a56473 |
12 | 5a92b53715 |
13 | 2b3c4b9580 |
14 | 16895c6c6d |
15 | bd176d61b |
hex | 715c55141 |
30430024001 has 8 divisors (see below), whose sum is σ = 32990735400. Its totient is φ = 27900732672.
The previous prime is 30430023973. The next prime is 30430024003. The reversal of 30430024001 is 10042003403.
It can be written as a sum of positive squares in 4 ways, for example, as 4668168976 + 25761855025 = 68324^2 + 160505^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30430024001 - 214 = 30430007617 is a prime.
It is a super-3 number, since 3×304300240013 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (30430024003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7853000 + ... + 7856873.
It is an arithmetic number, because the mean of its divisors is an integer number (4123841925).
Almost surely, 230430024001 is an apocalyptic number.
It is an amenable number.
30430024001 is a deficient number, since it is larger than the sum of its proper divisors (2560711399).
30430024001 is a wasteful number, since it uses less digits than its factorization.
30430024001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15710035.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 30430024001 its reverse (10042003403), we get a palindrome (40472027404).
The spelling of 30430024001 in words is "thirty billion, four hundred thirty million, twenty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •