Base | Representation |
---|---|
bin | 101111000010000100… |
… | …1011000100010011001 |
3 | 100122200221202122210101 |
4 | 1132010021120202121 |
5 | 3123322313100441 |
6 | 114222132215401 |
7 | 10203622612561 |
oct | 1360411304231 |
9 | 318627678711 |
10 | 101001300121 |
11 | 3991a667767 |
12 | 176a916a561 |
13 | 96a80b3617 |
14 | 4c62029da1 |
15 | 29620c6231 |
hex | 1784258899 |
101001300121 has 8 divisors (see below), whose sum is σ = 101897899488. Its totient is φ = 100106604000.
The previous prime is 101001300091. The next prime is 101001300187. The reversal of 101001300121 is 121003100101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101001300121 - 213 = 101001291929 is a prime.
It is a super-2 number, since 2×1010013001212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101001300098 and 101001300107.
It is not an unprimeable number, because it can be changed into a prime (101001300721) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 369100 + ... + 581581.
It is an arithmetic number, because the mean of its divisors is an integer number (12737237436).
Almost surely, 2101001300121 is an apocalyptic number.
It is an amenable number.
101001300121 is a deficient number, since it is larger than the sum of its proper divisors (896599367).
101001300121 is an equidigital number, since it uses as much as digits as its factorization.
101001300121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 951623.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 101001300121 its reverse (121003100101), we get a palindrome (222004400222).
The spelling of 101001300121 in words is "one hundred one billion, one million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •