Base | Representation |
---|---|
bin | 101110100100100011… |
… | …1101100010010111101 |
3 | 100120010221100020210221 |
4 | 1131021013230102331 |
5 | 3114310304013041 |
6 | 113535554501341 |
7 | 10140236324311 |
oct | 1351107542275 |
9 | 316127306727 |
10 | 100011001021 |
11 | 3946166a358 |
12 | 17471594851 |
13 | 957ab91b19 |
14 | 4baa6c5b41 |
15 | 29051ae2d1 |
hex | 17491ec4bd |
100011001021 has 8 divisors (see below), whose sum is σ = 100487682360. Its totient is φ = 99535446528.
The previous prime is 100011001009. The next prime is 100011001093. The reversal of 100011001021 is 120100110001.
It can be written as a sum of positive squares in 4 ways, for example, as 10242452025 + 89768548996 = 101205^2 + 299614^2 .
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 100011001021 - 219 = 100010476733 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100011000995 and 100011001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100011001721) 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, 103516 + ... + 459061.
It is an arithmetic number, because the mean of its divisors is an integer number (12560960295).
Almost surely, 2100011001021 is an apocalyptic number.
It is an amenable number.
100011001021 is a deficient number, since it is larger than the sum of its proper divisors (476681339).
100011001021 is an equidigital number, since it uses as much as digits as its factorization.
100011001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 563423.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 100011001021 its reverse (120100110001), we get a palindrome (220111111022).
The spelling of 100011001021 in words is "one hundred billion, eleven million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •