Base | Representation |
---|---|
bin | 1001001000111111011000… |
… | …00011000101100100011001 |
3 | 2122011112220101020201100211 |
4 | 10210133230003011210121 |
5 | 10113310012211211301 |
6 | 110425510350131121 |
7 | 4143120342535552 |
oct | 444375403054431 |
9 | 78145811221324 |
10 | 20100112210201 |
11 | 644a456374341 |
12 | 2307652ab0aa1 |
13 | b2a58112083a |
14 | 4d6bca16b329 |
15 | 24ccb3d88051 |
hex | 1247ec0c5919 |
20100112210201 has 4 divisors (see below), whose sum is σ = 20100305790900. Its totient is φ = 20099918629504.
The previous prime is 20100112210133. The next prime is 20100112210237. The reversal of 20100112210201 is 10201221100102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5549091633801 + 14551020576400 = 2355651^2 + 3814580^2 .
It is a cyclic number.
It is not a de Polignac number, because 20100112210201 - 211 = 20100112208153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20100112210501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 96634516 + ... + 96842293.
It is an arithmetic number, because the mean of its divisors is an integer number (5025076447725).
Almost surely, 220100112210201 is an apocalyptic number.
It is an amenable number.
20100112210201 is a deficient number, since it is larger than the sum of its proper divisors (193580699).
20100112210201 is a wasteful number, since it uses less digits than its factorization.
20100112210201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193580698.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20100112210201 its reverse (10201221100102), we get a palindrome (30301333310303).
The spelling of 20100112210201 in words is "twenty trillion, one hundred billion, one hundred twelve million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •