Base | Representation |
---|---|
bin | 101111110010110101001000… |
… | …100001010010110111000101 |
3 | 1000120021001001211002022200222 |
4 | 233302311020201102313011 |
5 | 210022414040021333333 |
6 | 2023021034151114125 |
7 | 62163351652203323 |
oct | 5762651041226705 |
9 | 1016231054068628 |
10 | 210201211121093 |
11 | 60a8191881a795 |
12 | 1b6aa4a0372945 |
13 | 9039b7362296a |
14 | 39c9b15a1ad13 |
15 | 1947c3893c298 |
hex | bf2d48852dc5 |
210201211121093 has 8 divisors (see below), whose sum is σ = 210253082711616. Its totient is φ = 210149344389600.
The previous prime is 210201211121063. The next prime is 210201211121119. The reversal of 210201211121093 is 390121112102012.
210201211121093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 210201211121093 - 26 = 210201211121029 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 (210201211121063) 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, 86088458 + ... + 88496468.
It is an arithmetic number, because the mean of its divisors is an integer number (26281635338952).
Almost surely, 2210201211121093 is an apocalyptic number.
It is an amenable number.
210201211121093 is a deficient number, since it is larger than the sum of its proper divisors (51871590523).
210201211121093 is a wasteful number, since it uses less digits than its factorization.
210201211121093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2429515.
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 210201211121093 in words is "two hundred ten trillion, two hundred one billion, two hundred eleven million, one hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •