Base | Representation |
---|---|
bin | 1101101111100011000001… |
… | …01011111101101011000001 |
3 | 10222000002201021211021102002 |
4 | 12313301200223331223001 |
5 | 12430120113040012233 |
6 | 144135201414033345 |
7 | 6236252564563253 |
oct | 667614053755301 |
9 | 128002637737362 |
10 | 30221012032193 |
11 | 96a1728483014 |
12 | 348104b948855 |
13 | 13b2aa19c6a68 |
14 | 7669c1d13cd3 |
15 | 3761b7c756e8 |
hex | 1b7c60afdac1 |
30221012032193 has 4 divisors (see below), whose sum is σ = 31998718622340. Its totient is φ = 28443305442048.
The previous prime is 30221012032157. The next prime is 30221012032199. The reversal of 30221012032193 is 39123021012203.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 24623756346289 + 5597255685904 = 4962233^2 + 2365852^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30221012032193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30221012032199) 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, 888853295048 + ... + 888853295081.
It is an arithmetic number, because the mean of its divisors is an integer number (7999679655585).
Almost surely, 230221012032193 is an apocalyptic number.
It is an amenable number.
30221012032193 is a deficient number, since it is larger than the sum of its proper divisors (1777706590147).
30221012032193 is a wasteful number, since it uses less digits than its factorization.
30221012032193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1777706590146.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 30221012032193 its reverse (39123021012203), we get a palindrome (69344033044396).
The spelling of 30221012032193 in words is "thirty trillion, two hundred twenty-one billion, twelve million, thirty-two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •