Base | Representation |
---|---|
bin | 1001100011011110001011… |
… | …00101111100001010000101 |
3 | 2202101112111000211202012201 |
4 | 10301233011211330022011 |
5 | 10223211440011231041 |
6 | 112403505533314501 |
7 | 4265631250156210 |
oct | 461570545741205 |
9 | 82345430752181 |
10 | 21010000102021 |
11 | 6770322367657 |
12 | 2433a66635a31 |
13 | b953082a42b8 |
14 | 528c64852777 |
15 | 2667b94ca631 |
hex | 131bc597c285 |
21010000102021 has 8 divisors (see below), whose sum is σ = 24051514550400. Its totient is φ = 17978507119248.
The previous prime is 21010000101991. The next prime is 21010000102027. The reversal of 21010000102021 is 12020100001012.
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 21010000102021 - 213 = 21010000093829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21010000101989 and 21010000102007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21010000102027) 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, 2505361906 + ... + 2505370291.
It is an arithmetic number, because the mean of its divisors is an integer number (3006439318800).
Almost surely, 221010000102021 is an apocalyptic number.
It is an amenable number.
21010000102021 is a deficient number, since it is larger than the sum of its proper divisors (3041514448379).
21010000102021 is an equidigital number, since it uses as much as digits as its factorization.
21010000102021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5010732803.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 21010000102021 its reverse (12020100001012), we get a palindrome (33030100103033).
The spelling of 21010000102021 in words is "twenty-one trillion, ten billion, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •