Base | Representation |
---|---|
bin | 1101101111100011000011… |
… | …11000001011010111010101 |
3 | 10222000002202200102022111002 |
4 | 12313301201320023113111 |
5 | 12430120133143324341 |
6 | 144135203410153045 |
7 | 6236253226444202 |
oct | 667614170132725 |
9 | 128002680368432 |
10 | 30221032011221 |
11 | 96a1738789607 |
12 | 3481056582785 |
13 | 13b2aa5ba077c |
14 | 7669c4834ca9 |
15 | 3761b98c029b |
hex | 1b7c61e0b5d5 |
30221032011221 has 16 divisors (see below), whose sum is σ = 30442329924864. Its totient is φ = 30000109636224.
The previous prime is 30221032011199. The next prime is 30221032011227. The reversal of 30221032011221 is 12211023012203.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30221032011221 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30221032011193 and 30221032011202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30221032011227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1049072000 + ... + 1049100806.
It is an arithmetic number, because the mean of its divisors is an integer number (1902645620304).
Almost surely, 230221032011221 is an apocalyptic number.
It is an amenable number.
30221032011221 is a deficient number, since it is larger than the sum of its proper divisors (221297913643).
30221032011221 is a wasteful number, since it uses less digits than its factorization.
30221032011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35060.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 30221032011221 its reverse (12211023012203), we get a palindrome (42432055023424).
The spelling of 30221032011221 in words is "thirty trillion, two hundred twenty-one billion, thirty-two million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •