Base | Representation |
---|---|
bin | 1101111000110111110111… |
… | …11100011111110000100111 |
3 | 11000010201210202212212102120 |
4 | 12330123323330133300213 |
5 | 13000342334232231003 |
6 | 144542313524041023 |
7 | 6301355315104431 |
oct | 674337374376047 |
9 | 130121722785376 |
10 | 30541444414503 |
11 | 9805610181590 |
12 | 3513177b33173 |
13 | 140707996bcc9 |
14 | 7782dc931651 |
15 | 37e6be10d853 |
hex | 1bc6fbf1fc27 |
30541444414503 has 8 divisors (see below), whose sum is σ = 44423919148416. Its totient is φ = 18509966311800.
The previous prime is 30541444414499. The next prime is 30541444414519.
30541444414503 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30541444414503 - 22 = 30541444414499 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30541444414553) 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, 462749157763 + ... + 462749157828.
It is an arithmetic number, because the mean of its divisors is an integer number (5552989893552).
Almost surely, 230541444414503 is an apocalyptic number.
30541444414503 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
30541444414503 is a deficient number, since it is larger than the sum of its proper divisors (13882474733913).
30541444414503 is a wasteful number, since it uses less digits than its factorization.
30541444414503 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 925498315605.
The product of its (nonzero) digits is 921600, while the sum is 42.
It can be divided in two parts, 3054144 and 4414503, that added together give a palindrome (7468647).
The spelling of 30541444414503 in words is "thirty trillion, five hundred forty-one billion, four hundred forty-four million, four hundred fourteen thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.245 sec. • engine limits •