Base | Representation |
---|---|
bin | 1001000111010011111101… |
… | …0100011000101010110101 |
3 | 1022111000112010022021001110 |
4 | 2101310333110120222311 |
5 | 2303141430034310401 |
6 | 33151404012545233 |
7 | 2053003125063360 |
oct | 221647724305265 |
9 | 38430463267043 |
10 | 10021221010101 |
11 | 3213a81009aa4 |
12 | 115a21a782219 |
13 | 578cc67a2732 |
14 | 26905b6530d7 |
15 | 125a1ce999d6 |
hex | 91d3f518ab5 |
10021221010101 has 64 divisors (see below), whose sum is σ = 15730275912192. Its totient is φ = 5556902400000.
The previous prime is 10021221010091. The next prime is 10021221010271. The reversal of 10021221010101 is 10101012212001.
It is not a de Polignac number, because 10021221010101 - 217 = 10021220879029 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021221010601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 36218241 + ... + 36493881.
It is an arithmetic number, because the mean of its divisors is an integer number (245785561128).
Almost surely, 210021221010101 is an apocalyptic number.
It is an amenable number.
10021221010101 is a deficient number, since it is larger than the sum of its proper divisors (5709054902091).
10021221010101 is a wasteful number, since it uses less digits than its factorization.
10021221010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276094.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10021221010101 its reverse (10101012212001), we get a palindrome (20122233222102).
It can be divided in two parts, 10021 and 221010101, that added together give a palindrome (221020122).
The spelling of 10021221010101 in words is "ten trillion, twenty-one billion, two hundred twenty-one million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •