Base | Representation |
---|---|
bin | 101111110001100000001101… |
… | …001111001101100110100001 |
3 | 1000112221022200201001202220120 |
4 | 233301200031033031212201 |
5 | 210014420311141241001 |
6 | 2022511113420230453 |
7 | 62153643135233442 |
oct | 5761401517154641 |
9 | 1015838621052816 |
10 | 210110022212001 |
11 | 60a47183a886aa |
12 | 1b69489139b429 |
13 | 90313a03c04a2 |
14 | 39c5544c792c9 |
15 | 194569d016236 |
hex | bf180d3cd9a1 |
210110022212001 has 36 divisors (see below), whose sum is σ = 291433648624272. Its totient is φ = 134645544784224.
The previous prime is 210110022211963. The next prime is 210110022212029. The reversal of 210110022212001 is 100212220011012.
210110022212001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 210110022212001 - 29 = 210110022211489 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (210110022212071) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 24580030 + ... + 32006216.
It is an arithmetic number, because the mean of its divisors is an integer number (8095379128452).
Almost surely, 2210110022212001 is an apocalyptic number.
It is an amenable number.
210110022212001 is a deficient number, since it is larger than the sum of its proper divisors (81323626412271).
210110022212001 is an frugal number, since it uses more digits than its factorization.
210110022212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7426430 (or 7426310 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210110022212001 its reverse (100212220011012), we get a palindrome (310322242223013).
The spelling of 210110022212001 in words is "two hundred ten trillion, one hundred ten billion, twenty-two million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •