Base | Representation |
---|---|
bin | 11101000110110101001… |
… | …10110100011100000101 |
3 | 10112121102200122001220100 |
4 | 32203122212310130011 |
5 | 112341201101201041 |
6 | 2043234542154313 |
7 | 132153260632302 |
oct | 16433246643405 |
9 | 3477380561810 |
10 | 1000100022021 |
11 | 35615a431a21 |
12 | 1419ab582999 |
13 | 73402c19379 |
14 | 365958420a9 |
15 | 1b0354226b6 |
hex | e8da9b4705 |
1000100022021 has 24 divisors (see below), whose sum is σ = 1489823329280. Its totient is φ = 646100110656.
The previous prime is 1000100021923. The next prime is 1000100022043. The reversal of 1000100022021 is 1202200010001.
1000100022021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-1000100022021 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000100021994 and 1000100022012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000100022121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10125016 + ... + 10223313.
Almost surely, 21000100022021 is an apocalyptic number.
It is an amenable number.
1000100022021 is a deficient number, since it is larger than the sum of its proper divisors (489723307259).
1000100022021 is a wasteful number, since it uses less digits than its factorization.
1000100022021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20348505 (or 20348502 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1000100022021 its reverse (1202200010001), we get a palindrome (2202300032022).
The spelling of 1000100022021 in words is "one trillion, one hundred million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •