Base | Representation |
---|---|
bin | 1101110010011101101011… |
… | …01110110110111101011111 |
3 | 10222100200101011122002102021 |
4 | 12321032311232312331133 |
5 | 12433240331103233203 |
6 | 144253213321041011 |
7 | 6246431113613440 |
oct | 671166556667537 |
9 | 128320334562367 |
10 | 30321223102303 |
11 | 9730181a72221 |
12 | 3498558326167 |
13 | 13bc382168453 |
14 | 76b7aadd92c7 |
15 | 378ad07a45bd |
hex | 1b93b5bb6f5f |
30321223102303 has 8 divisors (see below), whose sum is σ = 36691227955872. Its totient is φ = 24460818637056.
The previous prime is 30321223102277. The next prime is 30321223102327. The reversal of 30321223102303 is 30320132212303.
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 30321223102303 - 29 = 30321223101791 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30321223102343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127400096950 + ... + 127400097187.
It is an arithmetic number, because the mean of its divisors is an integer number (4586403494484).
Almost surely, 230321223102303 is an apocalyptic number.
30321223102303 is a deficient number, since it is larger than the sum of its proper divisors (6370004853569).
30321223102303 is a wasteful number, since it uses less digits than its factorization.
30321223102303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254800194161.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 30321223102303 its reverse (30320132212303), we get a palindrome (60641355314606).
The spelling of 30321223102303 in words is "thirty trillion, three hundred twenty-one billion, two hundred twenty-three million, one hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •