Base | Representation |
---|---|
bin | 1101101111100011000010… |
… | …10110010000111110101011 |
3 | 10222000002202001200122211121 |
4 | 12313301201112100332223 |
5 | 12430120123404340243 |
6 | 144135202451440111 |
7 | 6236253061050136 |
oct | 667614126207653 |
9 | 128002661618747 |
10 | 30221023121323 |
11 | 96a1733767491 |
12 | 34810535b6037 |
13 | 13b2aa40aa288 |
14 | 7669c359d21d |
15 | 3761b8c161ed |
hex | 1b7c61590fab |
30221023121323 has 4 divisors (see below), whose sum is σ = 30221098173448. Its totient is φ = 30220948069200.
The previous prime is 30221023121279. The next prime is 30221023121357. The reversal of 30221023121323 is 32312132012203.
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 30221023121323 - 29 = 30221023120811 is a prime.
It is a super-3 number, since 3×302210231213233 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30221023121363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36918786 + ... + 37728487.
It is an arithmetic number, because the mean of its divisors is an integer number (7555274543362).
Almost surely, 230221023121323 is an apocalyptic number.
30221023121323 is a deficient number, since it is larger than the sum of its proper divisors (75052125).
30221023121323 is an equidigital number, since it uses as much as digits as its factorization.
30221023121323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75052124.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 30221023121323 its reverse (32312132012203), we get a palindrome (62533155133526).
The spelling of 30221023121323 in words is "thirty trillion, two hundred twenty-one billion, twenty-three million, one hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •