Base | Representation |
---|---|
bin | 101111111110110000101000… |
… | …111011111111011011010001 |
3 | 1000200011102010201010110211110 |
4 | 233332300220323333123101 |
5 | 210124332022110031001 |
6 | 2024445415052403533 |
7 | 62306523410543616 |
oct | 5776605073773321 |
9 | 1020142121113743 |
10 | 211021020002001 |
11 | 6126856a536940 |
12 | 1b8013547765a9 |
13 | 90992734ac031 |
14 | 3a17686b1850d |
15 | 195e21ace73d6 |
hex | bfec28eff6d1 |
211021020002001 has 64 divisors (see below), whose sum is σ = 313473677239296. Its totient is φ = 125195596416000.
The previous prime is 211021020001943. The next prime is 211021020002017. The reversal of 211021020002001 is 100200020120112.
It is not a de Polignac number, because 211021020002001 - 213 = 211021019993809 is a prime.
It is a super-2 number, since 2×2110210200020012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211021020002041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1864959910 + ... + 1865073056.
It is an arithmetic number, because the mean of its divisors is an integer number (4898026206864).
Almost surely, 2211021020002001 is an apocalyptic number.
It is an amenable number.
211021020002001 is a deficient number, since it is larger than the sum of its proper divisors (102452657237295).
211021020002001 is a wasteful number, since it uses less digits than its factorization.
211021020002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119022.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 211021020002001 its reverse (100200020120112), we get a palindrome (311221040122113).
The spelling of 211021020002001 in words is "two hundred eleven trillion, twenty-one billion, twenty million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •