Base | Representation |
---|---|
bin | 11100010110011011… |
… | …101000101100100001 |
3 | 2220120111022211120112 |
4 | 130112123220230201 |
5 | 444320411130101 |
6 | 21552350421105 |
7 | 2125234126445 |
oct | 342633505441 |
9 | 86514284515 |
10 | 30441114401 |
11 | 11a01240895 |
12 | 5a96801795 |
13 | 2b418a0539 |
14 | 168ac72825 |
15 | bd270e6bb |
hex | 7166e8b21 |
30441114401 has 4 divisors (see below), whose sum is σ = 30457597632. Its totient is φ = 30424631172.
The previous prime is 30441114367. The next prime is 30441114419. The reversal of 30441114401 is 10441114403.
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 30441114401 - 218 = 30440852257 is a prime.
It is a super-2 number, since 2×304411144012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30441114421) 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, 8238845 + ... + 8242538.
It is an arithmetic number, because the mean of its divisors is an integer number (7614399408).
Almost surely, 230441114401 is an apocalyptic number.
It is an amenable number.
30441114401 is a deficient number, since it is larger than the sum of its proper divisors (16483231).
30441114401 is a wasteful number, since it uses less digits than its factorization.
30441114401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16483230.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 30441114401 its reverse (10441114403), we get a palindrome (40882228804).
The spelling of 30441114401 in words is "thirty billion, four hundred forty-one million, one hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •