Base | Representation |
---|---|
bin | 101111110010110100111011… |
… | …111011111100001000110101 |
3 | 1000120021000112002211100220001 |
4 | 233302310323323330020311 |
5 | 210022413122000031401 |
6 | 2023021001210111301 |
7 | 62163343506546133 |
oct | 5762647373741065 |
9 | 1016230462740801 |
10 | 210201000002101 |
11 | 60a8181a632989 |
12 | 1b6aa44171b531 |
13 | 9039b3b974694 |
14 | 39c9ad5982753 |
15 | 1947c25138601 |
hex | bf2d3befc235 |
210201000002101 has 4 divisors (see below), whose sum is σ = 211080502094400. Its totient is φ = 209321497909804.
The previous prime is 210201000002039. The next prime is 210201000002107. The reversal of 210201000002101 is 101200000102012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 210201000002101 - 27 = 210201000001973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210201000002107) 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, 439751045791 + ... + 439751046268.
It is an arithmetic number, because the mean of its divisors is an integer number (52770125523600).
Almost surely, 2210201000002101 is an apocalyptic number.
It is an amenable number.
210201000002101 is a deficient number, since it is larger than the sum of its proper divisors (879502092299).
210201000002101 is an equidigital number, since it uses as much as digits as its factorization.
210201000002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 879502092298.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 210201000002101 its reverse (101200000102012), we get a palindrome (311401000104113).
The spelling of 210201000002101 in words is "two hundred ten trillion, two hundred one billion, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •