Base | Representation |
---|---|
bin | 101101110000001011100001… |
… | …100000001100110010111101 |
3 | 222101110201201221000202020211 |
4 | 231300023201200030302331 |
5 | 202333314201242212341 |
6 | 1551544323124112421 |
7 | 60245611360364215 |
oct | 5560134140146275 |
9 | 871421657022224 |
10 | 201223001132221 |
11 | 591302172a2522 |
12 | 1a69a447b35711 |
13 | 883832ac411a3 |
14 | 3799360c53245 |
15 | 183e413210181 |
hex | b702e180ccbd |
201223001132221 has 16 divisors (see below), whose sum is σ = 201829541760000. Its totient is φ = 200617313306688.
The previous prime is 201223001132189. The next prime is 201223001132249. The reversal of 201223001132221 is 122231100322102.
It is a cyclic number.
It is not a de Polignac number, because 201223001132221 - 25 = 201223001132189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201223001132192 and 201223001132201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201223001136221) 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, 8889108315 + ... + 8889130951.
It is an arithmetic number, because the mean of its divisors is an integer number (12614346360000).
Almost surely, 2201223001132221 is an apocalyptic number.
It is an amenable number.
201223001132221 is a deficient number, since it is larger than the sum of its proper divisors (606540627779).
201223001132221 is a wasteful number, since it uses less digits than its factorization.
201223001132221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40308.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 201223001132221 its reverse (122231100322102), we get a palindrome (323454101454323).
The spelling of 201223001132221 in words is "two hundred one trillion, two hundred twenty-three billion, one million, one hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •