Base | Representation |
---|---|
bin | 11100010101001111… |
… | …011011000010100001 |
3 | 2220112002201210201000 |
4 | 130111033123002201 |
5 | 444300302314041 |
6 | 21550354302213 |
7 | 2124602246130 |
oct | 342517330241 |
9 | 86462653630 |
10 | 30421135521 |
11 | 119a0a35417 |
12 | 5a8bb87969 |
13 | 2b3a6c690a |
14 | 1688351917 |
15 | bd0ab4bb6 |
hex | 7153db0a1 |
30421135521 has 16 divisors (see below), whose sum is σ = 51506684800. Its totient is φ = 17383505904.
The previous prime is 30421135519. The next prime is 30421135529. The reversal of 30421135521 is 12553112403.
30421135521 is a `hidden beast` number, since 3 + 0 + 4 + 2 + 1 + 135 + 521 = 666.
It is not a de Polignac number, because 30421135521 - 21 = 30421135519 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (30421135529) 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 15 ways as a sum of consecutive naturals, for example, 80479006 + ... + 80479383.
It is an arithmetic number, because the mean of its divisors is an integer number (3219167800).
Almost surely, 230421135521 is an apocalyptic number.
It is an amenable number.
30421135521 is a deficient number, since it is larger than the sum of its proper divisors (21085549279).
30421135521 is a wasteful number, since it uses less digits than its factorization.
30421135521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160958405 (or 160958399 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 30421135521 its reverse (12553112403), we get a palindrome (42974247924).
The spelling of 30421135521 in words is "thirty billion, four hundred twenty-one million, one hundred thirty-five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •