Base | Representation |
---|---|
bin | 101111110010110100111011… |
… | …111111110100101100110011 |
3 | 1000120021000112011202002110211 |
4 | 233302310323333310230303 |
5 | 210022413122230121321 |
6 | 2023021001244004551 |
7 | 62163343521316315 |
oct | 5762647377645463 |
9 | 1016230464662424 |
10 | 210201001020211 |
11 | 60a818201688a3 |
12 | 1b6aa441b30757 |
13 | 9039b3bc3cc06 |
14 | 39c9ad5b697b5 |
15 | 1947c2528a0e1 |
hex | bf2d3bff4b33 |
210201001020211 has 4 divisors (see below), whose sum is σ = 211268011177872. Its totient is φ = 209133990862552.
The previous prime is 210201001020139. The next prime is 210201001020253. The reversal of 210201001020211 is 112020100102012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210201001020211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210201001020191 and 210201001020200.
It is not an unprimeable number, because it can be changed into a prime (210201001020911) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 533505078535 + ... + 533505078928.
It is an arithmetic number, because the mean of its divisors is an integer number (52817002794468).
Almost surely, 2210201001020211 is an apocalyptic number.
210201001020211 is a deficient number, since it is larger than the sum of its proper divisors (1067010157661).
210201001020211 is a wasteful number, since it uses less digits than its factorization.
210201001020211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1067010157660.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210201001020211 its reverse (112020100102012), we get a palindrome (322221101122223).
The spelling of 210201001020211 in words is "two hundred ten trillion, two hundred one billion, one million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •