Base | Representation |
---|---|
bin | 10110101111011111000101… |
… | …101111100011101000001001 |
3 | 111010010211200011200202211002 |
4 | 112233133011233203220021 |
5 | 101102212403034001301 |
6 | 552420353304544345 |
7 | 30032136213616505 |
oct | 2657370557435011 |
9 | 433124604622732 |
10 | 100020221000201 |
11 | 29962379261997 |
12 | b2747097820b5 |
13 | 43a6b3554b618 |
14 | 1a9b00c5c5305 |
15 | b86b4eb4216b |
hex | 5af7c5be3a09 |
100020221000201 has 2 divisors, whose sum is σ = 100020221000202. Its totient is φ = 100020221000200.
The previous prime is 100020221000191. The next prime is 100020221000239. The reversal of 100020221000201 is 102000122020001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98372694726601 + 1647526273600 = 9918301^2 + 1283560^2 .
It is a cyclic number.
It is not a de Polignac number, because 100020221000201 - 222 = 100020216805897 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (100020221000501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50010110500100 + 50010110500101.
It is an arithmetic number, because the mean of its divisors is an integer number (50010110500101).
Almost surely, 2100020221000201 is an apocalyptic number.
It is an amenable number.
100020221000201 is a deficient number, since it is larger than the sum of its proper divisors (1).
100020221000201 is an equidigital number, since it uses as much as digits as its factorization.
100020221000201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 100020221000201 its reverse (102000122020001), we get a palindrome (202020343020202).
The spelling of 100020221000201 in words is "one hundred trillion, twenty billion, two hundred twenty-one million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •