Base | Representation |
---|---|
bin | 1101101111100011001011… |
… | …11100101011111011000111 |
3 | 10222000002221102220211212001 |
4 | 12313301211330223323013 |
5 | 12430120303134131043 |
6 | 144135214250010131 |
7 | 6236255016061561 |
oct | 667614574537307 |
9 | 128002842824761 |
10 | 30221100302023 |
11 | 96a1773292494 |
12 | 3481075416947 |
13 | 13b2ab7091327 |
14 | 7669cd930331 |
15 | 3761c08ae74d |
hex | 1b7c65f2bec7 |
30221100302023 has 4 divisors (see below), whose sum is σ = 30238107113200. Its totient is φ = 30204093490848.
The previous prime is 30221100302017. The next prime is 30221100302137. The reversal of 30221100302023 is 32020300112203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30221100302023 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30221100302423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8503402923 + ... + 8503406476.
It is an arithmetic number, because the mean of its divisors is an integer number (7559526778300).
Almost surely, 230221100302023 is an apocalyptic number.
30221100302023 is a deficient number, since it is larger than the sum of its proper divisors (17006811177).
30221100302023 is a wasteful number, since it uses less digits than its factorization.
30221100302023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17006811176.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 30221100302023 its reverse (32020300112203), we get a palindrome (62241400414226).
The spelling of 30221100302023 in words is "thirty trillion, two hundred twenty-one billion, one hundred million, three hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •