Base | Representation |
---|---|
bin | 1001010010111100101001… |
… | …1011001100010101010101 |
3 | 1100012010111122202221100021 |
4 | 2110233022123030111111 |
5 | 2314430330032320341 |
6 | 33423304053145141 |
7 | 2103310651521106 |
oct | 224571233142525 |
9 | 40163448687307 |
10 | 10221123323221 |
11 | 3290832719638 |
12 | 1190b0962b1b1 |
13 | 591b037aac05 |
14 | 2749c27863ad |
15 | 12ad1ca749d1 |
hex | 94bca6cc555 |
10221123323221 has 16 divisors (see below), whose sum is σ = 10872026343936. Its totient is φ = 9587608091776.
The previous prime is 10221123323207. The next prime is 10221123323249. The reversal of 10221123323221 is 12232332112201.
10221123323221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10221123323221 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 (10221123323821) 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, 482601 + ... + 4546993.
It is an arithmetic number, because the mean of its divisors is an integer number (679501646496).
Almost surely, 210221123323221 is an apocalyptic number.
It is an amenable number.
10221123323221 is a deficient number, since it is larger than the sum of its proper divisors (650903020715).
10221123323221 is a wasteful number, since it uses less digits than its factorization.
10221123323221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4066532.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 10221123323221 its reverse (12232332112201), we get a palindrome (22453455435422).
The spelling of 10221123323221 in words is "ten trillion, two hundred twenty-one billion, one hundred twenty-three million, three hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •