Base | Representation |
---|---|
bin | 101110100100001111… |
… | …0111100110111111101 |
3 | 100120010012020122121101 |
4 | 1131020132330313331 |
5 | 3114300040233041 |
6 | 113534533533101 |
7 | 10140046463266 |
oct | 1351036746775 |
9 | 316105218541 |
10 | 100000321021 |
11 | 39456635307 |
12 | 17469aa4191 |
13 | 95788c28b3 |
14 | 4ba910596d |
15 | 290429eb31 |
hex | 17487bcdfd |
100000321021 has 4 divisors (see below), whose sum is σ = 100120949500. Its totient is φ = 99879692544.
The previous prime is 100000320983. The next prime is 100000321039. The reversal of 100000321021 is 120123000001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 84324028996 + 15676292025 = 290386^2 + 125205^2 .
It is a cyclic number.
It is not a de Polignac number, because 100000321021 - 229 = 99463450109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100000320989 and 100000321007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000321721) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60312996 + ... + 60314653.
It is an arithmetic number, because the mean of its divisors is an integer number (25030237375).
Almost surely, 2100000321021 is an apocalyptic number.
It is an amenable number.
100000321021 is a deficient number, since it is larger than the sum of its proper divisors (120628479).
100000321021 is an equidigital number, since it uses as much as digits as its factorization.
100000321021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120628478.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 100000321021 its reverse (120123000001), we get a palindrome (220123321022).
The spelling of 100000321021 in words is "one hundred billion, three hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •