Base | Representation |
---|---|
bin | 1101101111110100010111… |
… | …00111111001011011001101 |
3 | 10222000222202010202221210012 |
4 | 12313322023213321123031 |
5 | 12430243200003233401 |
6 | 144143341321523005 |
7 | 6240032365665560 |
oct | 667721347713315 |
9 | 128028663687705 |
10 | 30230322321101 |
11 | 96a5675935961 |
12 | 3482a09943465 |
13 | 13b3926838056 |
14 | 76722661a4d7 |
15 | 3765602e48bb |
hex | 1b7e8b9f96cd |
30230322321101 has 8 divisors (see below), whose sum is σ = 35391596864064. Its totient is φ = 25279712045280.
The previous prime is 30230322321041. The next prime is 30230322321137. The reversal of 30230322321101 is 10112322303203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30230322321101 - 214 = 30230322304717 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30230322321301) 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 7 ways as a sum of consecutive naturals, for example, 52666066475 + ... + 52666067048.
It is an arithmetic number, because the mean of its divisors is an integer number (4423949608008).
Almost surely, 230230322321101 is an apocalyptic number.
It is an amenable number.
30230322321101 is a deficient number, since it is larger than the sum of its proper divisors (5161274542963).
30230322321101 is a wasteful number, since it uses less digits than its factorization.
30230322321101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105332133571.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 30230322321101 its reverse (10112322303203), we get a palindrome (40342644624304).
The spelling of 30230322321101 in words is "thirty trillion, two hundred thirty billion, three hundred twenty-two million, three hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •