Base | Representation |
---|---|
bin | 10010101010011111… |
… | …01100011101001001 |
3 | 221212022121102212201 |
4 | 21111033230131021 |
5 | 131010122042301 |
6 | 4334141440201 |
7 | 503210356051 |
oct | 112517543511 |
9 | 27768542781 |
10 | 10020112201 |
11 | 4282101670 |
12 | 1b37870061 |
13 | c38c0c998 |
14 | 6b0aba561 |
15 | 3d9a32201 |
hex | 2553ec749 |
10020112201 has 4 divisors (see below), whose sum is σ = 10931031504. Its totient is φ = 9109192900.
The previous prime is 10020112187. The next prime is 10020112309. The reversal of 10020112201 is 10221102001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10020112201 - 213 = 10020104009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10020112801) 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, 455459635 + ... + 455459656.
It is an arithmetic number, because the mean of its divisors is an integer number (2732757876).
Almost surely, 210020112201 is an apocalyptic number.
10020112201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10020112201 is a deficient number, since it is larger than the sum of its proper divisors (910919303).
10020112201 is an equidigital number, since it uses as much as digits as its factorization.
10020112201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 910919302.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10020112201 its reverse (10221102001), we get a palindrome (20241214202).
It can be divided in two parts, 10020 and 112201, that added together give a palindrome (122221).
The spelling of 10020112201 in words is "ten billion, twenty million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •