Base | Representation |
---|---|
bin | 1101110101001001001100… |
… | …00111111011001000100011 |
3 | 10222200111001101021021222211 |
4 | 12322210212013323020203 |
5 | 12441242421034100103 |
6 | 144403402321342551 |
7 | 6256201000253122 |
oct | 672444607731043 |
9 | 128614041237884 |
10 | 30413303034403 |
11 | 9766233765063 |
12 | 34b2375797a57 |
13 | 13c7c67b70283 |
14 | 77202423bab9 |
15 | 37b1be53236d |
hex | 1ba9261fb223 |
30413303034403 has 4 divisors (see below), whose sum is σ = 30454457707720. Its totient is φ = 30372148361088.
The previous prime is 30413303034371. The next prime is 30413303034407. The reversal of 30413303034403 is 30443030331403.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30413303034403 - 25 = 30413303034371 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30413303034407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20577335550 + ... + 20577337027.
It is an arithmetic number, because the mean of its divisors is an integer number (7613614426930).
Almost surely, 230413303034403 is an apocalyptic number.
30413303034403 is a deficient number, since it is larger than the sum of its proper divisors (41154673317).
30413303034403 is an equidigital number, since it uses as much as digits as its factorization.
30413303034403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41154673316.
The product of its (nonzero) digits is 46656, while the sum is 31.
Adding to 30413303034403 its reverse (30443030331403), we get a palindrome (60856333365806).
The spelling of 30413303034403 in words is "thirty trillion, four hundred thirteen billion, three hundred three million, thirty-four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •