Base | Representation |
---|---|
bin | 1010000011010000001100… |
… | …11101001001111001000001 |
3 | 2220020221011002010211212211 |
4 | 11001220012131021321001 |
5 | 10344104404030324301 |
6 | 115001305003422121 |
7 | 4440550261224301 |
oct | 501500635117101 |
9 | 86227132124784 |
10 | 22102010011201 |
11 | 70514564a90aa |
12 | 258b626524941 |
13 | c442978c8883 |
14 | 565a58ab1601 |
15 | 284dcd78c051 |
hex | 141a06749e41 |
22102010011201 has 8 divisors (see below), whose sum is σ = 23402269948680. Its totient is φ = 20801765818368.
The previous prime is 22102010011139. The next prime is 22102010011229. The reversal of 22102010011201 is 10211001020122.
It can be written as a sum of positive squares in 4 ways, for example, as 5421516412225 + 16680493598976 = 2328415^2 + 4084176^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22102010011201 - 213 = 22102010003009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22102010015201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 982696 + ... + 6720841.
It is an arithmetic number, because the mean of its divisors is an integer number (2925283743585).
Almost surely, 222102010011201 is an apocalyptic number.
It is an amenable number.
22102010011201 is a deficient number, since it is larger than the sum of its proper divisors (1300259937479).
22102010011201 is a wasteful number, since it uses less digits than its factorization.
22102010011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7872323.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22102010011201 its reverse (10211001020122), we get a palindrome (32313011031323).
The spelling of 22102010011201 in words is "twenty-two trillion, one hundred two billion, ten million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •