Base | Representation |
---|---|
bin | 1001000110101110000100… |
… | …01110101100110011100101 |
3 | 2121220002112122202210120110 |
4 | 10203113002032230303211 |
5 | 10111020230401400401 |
6 | 110330005403323233 |
7 | 4134356222101410 |
oct | 443270216546345 |
9 | 77802478683513 |
10 | 20022101200101 |
11 | 641a364174870 |
12 | 22b4501220519 |
13 | b230cb0a9830 |
14 | 4d3109622b77 |
15 | 24ac4a3049d6 |
hex | 1235c23acce5 |
20022101200101 has 128 divisors (see below), whose sum is σ = 36828115623936. Its totient is φ = 9337561390080.
The previous prime is 20022101200097. The next prime is 20022101200111. The reversal of 20022101200101 is 10100210122002.
It is not a de Polignac number, because 20022101200101 - 22 = 20022101200097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022101200111) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 270740536 + ... + 270814478.
It is an arithmetic number, because the mean of its divisors is an integer number (287719653312).
Almost surely, 220022101200101 is an apocalyptic number.
20022101200101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20022101200101 is a deficient number, since it is larger than the sum of its proper divisors (16806014423835).
20022101200101 is a wasteful number, since it uses less digits than its factorization.
20022101200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76451.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20022101200101 its reverse (10100210122002), we get a palindrome (30122311322103).
It can be divided in two parts, 20022101 and 200101, that added together give a palindrome (20222202).
The spelling of 20022101200101 in words is "twenty trillion, twenty-two billion, one hundred one million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •