Base | Representation |
---|---|
bin | 101101110001101000000000… |
… | …010011101110010101001101 |
3 | 222101211020001101111211010222 |
4 | 231301220000103232111031 |
5 | 202341431033331000323 |
6 | 1552102104442441125 |
7 | 60256025216511632 |
oct | 5561500023562515 |
9 | 871736041454128 |
10 | 201322302203213 |
11 | 5916934414a944 |
12 | 1a6b573b8031a5 |
13 | 88447c49c7b69 |
14 | 37a00a1138189 |
15 | 1841cc5dd99c8 |
hex | b71a004ee54d |
201322302203213 has 8 divisors (see below), whose sum is σ = 201344629731648. Its totient is φ = 201299975864064.
The previous prime is 201322302203179. The next prime is 201322302203221. The reversal of 201322302203213 is 312302203223102.
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-201322302203213 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201322302203513) 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, 362417645 + ... + 362972717.
It is an arithmetic number, because the mean of its divisors is an integer number (25168078716456).
Almost surely, 2201322302203213 is an apocalyptic number.
It is an amenable number.
201322302203213 is a deficient number, since it is larger than the sum of its proper divisors (22327528435).
201322302203213 is a wasteful number, since it uses less digits than its factorization.
201322302203213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 594643.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 201322302203213 its reverse (312302203223102), we get a palindrome (513624505426315).
The spelling of 201322302203213 in words is "two hundred one trillion, three hundred twenty-two billion, three hundred two million, two hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •