Base | Representation |
---|---|
bin | 11100010110011001… |
… | …000010010111001101 |
3 | 2220120110001020000012 |
4 | 130112121002113031 |
5 | 444320222324401 |
6 | 21552324043005 |
7 | 2125225261241 |
oct | 342631022715 |
9 | 86513036005 |
10 | 30440433101 |
11 | 11a00915a31 |
12 | 5a96533465 |
13 | 2b416c23c0 |
14 | 168ab36421 |
15 | bd26278bb |
hex | 7166425cd |
30440433101 has 8 divisors (see below), whose sum is σ = 32783784600. Its totient is φ = 28097335872.
The previous prime is 30440433097. The next prime is 30440433137. The reversal of 30440433101 is 10133404403.
It can be written as a sum of positive squares in 4 ways, for example, as 2659877476 + 27780555625 = 51574^2 + 166675^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 30440433101 - 22 = 30440433097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30440433901) 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 7 ways as a sum of consecutive naturals, for example, 238151 + ... + 342923.
It is an arithmetic number, because the mean of its divisors is an integer number (4097973075).
Almost surely, 230440433101 is an apocalyptic number.
It is an amenable number.
30440433101 is a deficient number, since it is larger than the sum of its proper divisors (2343351499).
30440433101 is a wasteful number, since it uses less digits than its factorization.
30440433101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127135.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 30440433101 its reverse (10133404403), we get a palindrome (40573837504).
The spelling of 30440433101 in words is "thirty billion, four hundred forty million, four hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •