Base | Representation |
---|---|
bin | 1101110011000011100011… |
… | …01000110110101110111111 |
3 | 10222102121212011122122012120 |
4 | 12321201301220312232333 |
5 | 12434104001202424203 |
6 | 144310415043134023 |
7 | 6251051013352515 |
oct | 671416150665677 |
9 | 128377764578176 |
10 | 30341555514303 |
11 | 97388660a3300 |
12 | 34a0491674313 |
13 | 13c127267b977 |
14 | 76c7794d04b5 |
15 | 3793c07d2b53 |
hex | 1b9871a36bbf |
30341555514303 has 48 divisors (see below), whose sum is σ = 46828727568000. Its totient is φ = 17413240680000.
The previous prime is 30341555514239. The next prime is 30341555514317.
30341555514303 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 30341555514303 - 26 = 30341555514239 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30341555518303) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14547973 + ... + 16502321.
It is an arithmetic number, because the mean of its divisors is an integer number (975598491000).
Almost surely, 230341555514303 is an apocalyptic number.
30341555514303 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
30341555514303 is a deficient number, since it is larger than the sum of its proper divisors (16487172053697).
30341555514303 is a wasteful number, since it uses less digits than its factorization.
30341555514303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1956644 (or 1956633 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 42.
It can be divided in two parts, 3034155 and 5514303, that added together give a palindrome (8548458).
The spelling of 30341555514303 in words is "thirty trillion, three hundred forty-one billion, five hundred fifty-five million, five hundred fourteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •