Base | Representation |
---|---|
bin | 1101110000010000010000… |
… | …11000100011110010011011 |
3 | 10222002102101222120212112221 |
4 | 12320020020120203302123 |
5 | 12431014333342313303 |
6 | 144154255453044511 |
7 | 6241102511114554 |
oct | 670101030436233 |
9 | 128072358525487 |
10 | 30245300354203 |
11 | 9700a61613910 |
12 | 34858a9a86737 |
13 | 13b517296262c |
14 | 767c4796332b |
15 | 376b3a21a4bd |
hex | 1b8208623c9b |
30245300354203 has 8 divisors (see below), whose sum is σ = 32995814068656. Its totient is φ = 27494943465600.
The previous prime is 30245300354197. The next prime is 30245300354237.
30245300354203 is nontrivially palindromic in base 10.
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 30245300354203 - 213 = 30245300346011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30245300354273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38803026 + ... + 39574807.
It is an arithmetic number, because the mean of its divisors is an integer number (4124476758582).
Almost surely, 230245300354203 is an apocalyptic number.
30245300354203 is a deficient number, since it is larger than the sum of its proper divisors (2750513714453).
30245300354203 is a wasteful number, since it uses less digits than its factorization.
30245300354203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78412925.
The product of its (nonzero) digits is 129600, while the sum is 34.
It can be divided in two parts, 30245300 and 354203, that added together give a palindrome (30599503).
The spelling of 30245300354203 in words is "thirty trillion, two hundred forty-five billion, three hundred million, three hundred fifty-four thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •