Base | Representation |
---|---|
bin | 110010100011011110101001… |
… | …110100011010011010010001 |
3 | 1002011020112111020022010200121 |
4 | 302203132221310122122101 |
5 | 213120311140300214301 |
6 | 2104513440202150241 |
7 | 64555364622426214 |
oct | 6243365164323221 |
9 | 1064215436263617 |
10 | 222340421101201 |
11 | 64932052344027 |
12 | 20b2b0911b2381 |
13 | 970a7c5007130 |
14 | 3cc9495d3977b |
15 | 1aa88b80293a1 |
hex | ca37a9d1a691 |
222340421101201 has 64 divisors (see below), whose sum is σ = 264683420467200. Its totient is φ = 184797696416256.
The previous prime is 222340421101171. The next prime is 222340421101219. The reversal of 222340421101201 is 102101124043222.
222340421101201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 222340421101201 - 213 = 222340421093009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222340421101291) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 620316700 + ... + 620675026.
It is an arithmetic number, because the mean of its divisors is an integer number (4135678444800).
Almost surely, 2222340421101201 is an apocalyptic number.
It is an amenable number.
222340421101201 is a deficient number, since it is larger than the sum of its proper divisors (42342999365999).
222340421101201 is a wasteful number, since it uses less digits than its factorization.
222340421101201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 359078.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 222340421101201 its reverse (102101124043222), we get a palindrome (324441545144423).
The spelling of 222340421101201 in words is "two hundred twenty-two trillion, three hundred forty billion, four hundred twenty-one million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •