Base | Representation |
---|---|
bin | 10110110000101001011110… |
… | …111110000010011111010001 |
3 | 111010102110212011020101211201 |
4 | 112300221132332002133101 |
5 | 101110020001341401001 |
6 | 552521203541111201 |
7 | 30040664551505131 |
oct | 2660513676023721 |
9 | 433373764211751 |
10 | 100100101122001 |
11 | 2999323a52a782 |
12 | b2880a13b8501 |
13 | 43b152589ca96 |
14 | 1aa0c29476ac1 |
15 | b88c77831501 |
hex | 5b0a5ef827d1 |
100100101122001 has 2 divisors, whose sum is σ = 100100101122002. Its totient is φ = 100100101122000.
The previous prime is 100100101121971. The next prime is 100100101122083. The reversal of 100100101122001 is 100221101001001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98357500476225 + 1742600645776 = 9917535^2 + 1320076^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100100101122001 is a prime.
It is not a weakly prime, because it can be changed into another prime (100100101125001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050050561000 + 50050050561001.
It is an arithmetic number, because the mean of its divisors is an integer number (50050050561001).
Almost surely, 2100100101122001 is an apocalyptic number.
It is an amenable number.
100100101122001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100100101122001 is an equidigital number, since it uses as much as digits as its factorization.
100100101122001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100100101122001 its reverse (100221101001001), we get a palindrome (200321202123002).
It can be divided in two parts, 100100 and 101122001, that added together give a palindrome (101222101).
The spelling of 100100101122001 in words is "one hundred trillion, one hundred billion, one hundred one million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •