Base | Representation |
---|---|
bin | 101111110001110100110010… |
… | …000001001000011000110101 |
3 | 1000120000102201022212200100212 |
4 | 233301310302001020120311 |
5 | 210020301032203122401 |
6 | 2022525205514315205 |
7 | 62155354451266334 |
oct | 5761646201103065 |
9 | 1016012638780325 |
10 | 210132114114101 |
11 | 60a55590314733 |
12 | 1b699017a28b05 |
13 | 90334b12ac0ca |
14 | 39c663ccddd1b |
15 | 1946042749dbb |
hex | bf1d32048635 |
210132114114101 has 8 divisors (see below), whose sum is σ = 211645073922240. Its totient is φ = 208619171705952.
The previous prime is 210132114114067. The next prime is 210132114114119. The reversal of 210132114114101 is 101411411231012.
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 210132114114101 - 242 = 205734067602997 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 (210132114114161) 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, 20395001 + ... + 28917473.
It is an arithmetic number, because the mean of its divisors is an integer number (26455634240280).
Almost surely, 2210132114114101 is an apocalyptic number.
It is an amenable number.
210132114114101 is a deficient number, since it is larger than the sum of its proper divisors (1512959808139).
210132114114101 is a wasteful number, since it uses less digits than its factorization.
210132114114101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8699995.
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 210132114114101 its reverse (101411411231012), we get a palindrome (311543525345113).
The spelling of 210132114114101 in words is "two hundred ten trillion, one hundred thirty-two billion, one hundred fourteen million, one hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •