Base | Representation |
---|---|
bin | 1101101111110110000001… |
… | …01011000001010100001111 |
3 | 10222001002001011111012122001 |
4 | 12313323000223001110033 |
5 | 12430302010324113203 |
6 | 144144005513533131 |
7 | 6240063423652453 |
oct | 667730053012417 |
9 | 128032034435561 |
10 | 30231212332303 |
11 | 96a5a92265504 |
12 | 3483017a141a7 |
13 | 13b3a39044cb8 |
14 | 7672ac8d6663 |
15 | 3765b34eb91d |
hex | 1b7ec0ac150f |
30231212332303 has 4 divisors (see below), whose sum is σ = 30231232217680. Its totient is φ = 30231192446928.
The previous prime is 30231212332261. The next prime is 30231212332381. The reversal of 30231212332303 is 30323321213203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30231212332303 - 213 = 30231212324111 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 (30231212332103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7454763 + ... + 10771996.
It is an arithmetic number, because the mean of its divisors is an integer number (7557808054420).
Almost surely, 230231212332303 is an apocalyptic number.
30231212332303 is a deficient number, since it is larger than the sum of its proper divisors (19885377).
30231212332303 is a wasteful number, since it uses less digits than its factorization.
30231212332303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19885376.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 30231212332303 its reverse (30323321213203), we get a palindrome (60554533545506).
The spelling of 30231212332303 in words is "thirty trillion, two hundred thirty-one billion, two hundred twelve million, three hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •