Base | Representation |
---|---|
bin | 10000001011101001100… |
… | …100011010101010100101 |
3 | 10221022022121012012102002 |
4 | 100023221210122222211 |
5 | 121204404132400401 |
6 | 2210504404055045 |
7 | 143224616512466 |
oct | 20135144325245 |
9 | 3838277165362 |
10 | 1112020200101 |
11 | 39967245a268 |
12 | 15b625394485 |
13 | 80b2b193305 |
14 | 3bb71a62d6d |
15 | 1ddd5db1a6b |
hex | 102e991aaa5 |
1112020200101 has 4 divisors (see below), whose sum is σ = 1112686481100. Its totient is φ = 1111353919104.
The previous prime is 1112020200097. The next prime is 1112020200209. The reversal of 1112020200101 is 1010020202111.
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 376104999076 + 735915201025 = 613274^2 + 857855^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112020200101 - 22 = 1112020200097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112020200301) 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, 333137996 + ... + 333141333.
It is an arithmetic number, because the mean of its divisors is an integer number (278171620275).
Almost surely, 21112020200101 is an apocalyptic number.
It is an amenable number.
1112020200101 is a deficient number, since it is larger than the sum of its proper divisors (666280999).
1112020200101 is an equidigital number, since it uses as much as digits as its factorization.
1112020200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 666280998.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1112020200101 its reverse (1010020202111), we get a palindrome (2122040402212).
The spelling of 1112020200101 in words is "one trillion, one hundred twelve billion, twenty million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •