Base | Representation |
---|---|
bin | 101110100100100100… |
… | …0011111100100001101 |
3 | 100120010221201220212201 |
4 | 1131021020133210031 |
5 | 3114310332223041 |
6 | 113540003201501 |
7 | 10140241160461 |
oct | 1351110374415 |
9 | 316127656781 |
10 | 100011211021 |
11 | 394617a3107 |
12 | 17471676291 |
13 | 957ac36597 |
14 | 4baa73c4a1 |
15 | 2905201631 |
hex | 174921f90d |
100011211021 has 8 divisors (see below), whose sum is σ = 109545748920. Its totient is φ = 90882398208.
The previous prime is 100011210961. The next prime is 100011211033. The reversal of 100011211021 is 120112110001.
It can be written as a sum of positive squares in 4 ways, for example, as 14253016996 + 85758194025 = 119386^2 + 292845^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-100011211021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100011210989 and 100011211007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100011211921) 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, 101430756 + ... + 101431741.
It is an arithmetic number, because the mean of its divisors is an integer number (13693218615).
Almost surely, 2100011211021 is an apocalyptic number.
It is an amenable number.
100011211021 is a deficient number, since it is larger than the sum of its proper divisors (9534537899).
100011211021 is a wasteful number, since it uses less digits than its factorization.
100011211021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202862543.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100011211021 its reverse (120112110001), we get a palindrome (220123321022).
The spelling of 100011211021 in words is "one hundred billion, eleven million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •