Base | Representation |
---|---|
bin | 101111110010110100001100… |
… | …010100000010001101111101 |
3 | 1000120020221110102101110122112 |
4 | 233302310030110002031331 |
5 | 210022410002424341333 |
6 | 2023020350025023405 |
7 | 62163314635340165 |
oct | 5762641424021575 |
9 | 1016227412343575 |
10 | 210200201012093 |
11 | 60a8144a621966 |
12 | 1b6aa25a024b65 |
13 | 9039a42286426 |
14 | 39c9a5b7db5a5 |
15 | 1947bc9e10948 |
hex | bf2d0c50237d |
210200201012093 has 2 divisors, whose sum is σ = 210200201012094. Its totient is φ = 210200201012092.
The previous prime is 210200201012029. The next prime is 210200201012159. The reversal of 210200201012093 is 390210102002012.
It is a happy number.
210200201012093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112360466400484 + 97839734611609 = 10600022^2 + 9891397^2 .
It is a cyclic number.
It is not a de Polignac number, because 210200201012093 - 26 = 210200201012029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210200201012293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105100100506046 + 105100100506047.
It is an arithmetic number, because the mean of its divisors is an integer number (105100100506047).
Almost surely, 2210200201012093 is an apocalyptic number.
It is an amenable number.
210200201012093 is a deficient number, since it is larger than the sum of its proper divisors (1).
210200201012093 is an equidigital number, since it uses as much as digits as its factorization.
210200201012093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
The spelling of 210200201012093 in words is "two hundred ten trillion, two hundred billion, two hundred one million, twelve thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •