Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …101110100001110111111101 |
3 | 111020121121020100102021021121 |
4 | 112331300200232201313331 |
5 | 101214300022000013041 |
6 | 554451115134430541 |
7 | 30163036635565201 |
oct | 2675604056416775 |
9 | 436547210367247 |
10 | 101001000001021 |
11 | 2a20031345669a |
12 | b3b2806662451 |
13 | 444847964c263 |
14 | 1ad268dda6b01 |
15 | ba2403c177d1 |
hex | 5bdc20ba1dfd |
101001000001021 has 8 divisors (see below), whose sum is σ = 102279701692800. Its totient is φ = 99722303509920.
The previous prime is 101001000001001. The next prime is 101001000001093. The reversal of 101001000001021 is 120100000100101.
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 101001000001021 - 223 = 101000991612413 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101001000000995 and 101001000001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001000001001) 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, 51041001 + ... + 52982881.
It is an arithmetic number, because the mean of its divisors is an integer number (12784962711600).
Almost surely, 2101001000001021 is an apocalyptic number.
It is an amenable number.
101001000001021 is a deficient number, since it is larger than the sum of its proper divisors (1278701691779).
101001000001021 is an equidigital number, since it uses as much as digits as its factorization.
101001000001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2600339.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 101001000001021 its reverse (120100000100101), we get a palindrome (221101000101122).
The spelling of 101001000001021 in words is "one hundred one trillion, one billion, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •