Base | Representation |
---|---|
bin | 110010100001111000001000… |
… | …000011101101100000101001 |
3 | 1002010212000100000011011220021 |
4 | 302201320020003231200221 |
5 | 213112010210223121301 |
6 | 2104351112224400441 |
7 | 64544416551244642 |
oct | 6241701003554051 |
9 | 1063760300134807 |
10 | 222230333020201 |
11 | 6489a39a503400 |
12 | 20b11888a76121 |
13 | 97002cc4aa8bc |
14 | 3cc40111886c9 |
15 | 1aa5ac33338a1 |
hex | ca1e080ed829 |
222230333020201 has 48 divisors (see below), whose sum is σ = 247073650992000. Its totient is φ = 199713518484480.
The previous prime is 222230333020181. The next prime is 222230333020237. The reversal of 222230333020201 is 102020333032222.
It is not a de Polignac number, because 222230333020201 - 217 = 222230332889129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222230333020261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 61002011086 + ... + 61002014728.
It is an arithmetic number, because the mean of its divisors is an integer number (5147367729000).
Almost surely, 2222230333020201 is an apocalyptic number.
It is an amenable number.
222230333020201 is a deficient number, since it is larger than the sum of its proper divisors (24843317971799).
222230333020201 is a wasteful number, since it uses less digits than its factorization.
222230333020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8350 (or 8339 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 222230333020201 its reverse (102020333032222), we get a palindrome (324250666052423).
The spelling of 222230333020201 in words is "two hundred twenty-two trillion, two hundred thirty billion, three hundred thirty-three million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •