Base | Representation |
---|---|
bin | 1010000000100100110101… |
… | …11100100101111111001001 |
3 | 2212221010200120122122221002 |
4 | 11000102122330211333021 |
5 | 10341103001033001301 |
6 | 114451132051024345 |
7 | 4431112421101631 |
oct | 500223274457711 |
9 | 85833616578832 |
10 | 22010012000201 |
11 | 7016436a79855 |
12 | 257583059b0b5 |
13 | c386c5b77684 |
14 | 56140c6b56c1 |
15 | 2827e6ce216b |
hex | 14049af25fc9 |
22010012000201 has 8 divisors (see below), whose sum is σ = 22967043946560. Its totient is φ = 21052986295792.
The previous prime is 22010012000183. The next prime is 22010012000227. The reversal of 22010012000201 is 10200021001022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22010012000201 is a prime.
It is a super-3 number, since 3×220100120002013 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22010012000261) 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, 6539810 + ... + 9316068.
It is an arithmetic number, because the mean of its divisors is an integer number (2870880493320).
Almost surely, 222010012000201 is an apocalyptic number.
It is an amenable number.
22010012000201 is a deficient number, since it is larger than the sum of its proper divisors (957031946359).
22010012000201 is a wasteful number, since it uses less digits than its factorization.
22010012000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3120975.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 22010012000201 its reverse (10200021001022), we get a palindrome (32210033001223).
The spelling of 22010012000201 in words is "twenty-two trillion, ten billion, twelve million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •