Base | Representation |
---|---|
bin | 101111110010110101000011… |
… | …000101101100110001100010 |
3 | 1000120021000211110121221121020 |
4 | 233302311003011230301202 |
5 | 210022413343210013442 |
6 | 2023021021134110310 |
7 | 62163346464534405 |
oct | 5762650305546142 |
9 | 1016230743557536 |
10 | 210201120001122 |
11 | 60a81881343a28 |
12 | 1b6aa47594b396 |
13 | 9039b5a79b013 |
14 | 39c9b0789bd3c |
15 | 1947c3093d9ec |
hex | bf2d4316cc62 |
210201120001122 has 8 divisors (see below), whose sum is σ = 420402240002256. Its totient is φ = 70067040000372.
The previous prime is 210201120001003. The next prime is 210201120001151. The reversal of 210201120001122 is 221100021102012.
210201120001122 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.
210201120001122 is an admirable number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17516760000088 + ... + 17516760000099.
It is an arithmetic number, because the mean of its divisors is an integer number (52550280000282).
Almost surely, 2210201120001122 is an apocalyptic number.
210201120001122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210201120001122 is a wasteful number, since it uses less digits than its factorization.
210201120001122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35033520000192.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210201120001122 its reverse (221100021102012), we get a palindrome (431301141103134).
The spelling of 210201120001122 in words is "two hundred ten trillion, two hundred one billion, one hundred twenty million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •