Base | Representation |
---|---|
bin | 101101100001010011111001… |
… | …011011000011011101110101 |
3 | 222020212001021212100020102012 |
4 | 231201103321123003131311 |
5 | 202220044024224020041 |
6 | 1545443054532254005 |
7 | 60112026242054330 |
oct | 5541237133033565 |
9 | 866761255306365 |
10 | 200201200220021 |
11 | 58876941320620 |
12 | 1a554400a71305 |
13 | 8792b7a14b700 |
14 | 3761b0b291617 |
15 | 1822a5ca943eb |
hex | b614f96c3775 |
200201200220021 has 48 divisors (see below), whose sum is σ = 286177281579648. Its totient is φ = 135530224128000.
The previous prime is 200201200220009. The next prime is 200201200220029. The reversal of 200201200220021 is 120022002102002.
It is not a de Polignac number, because 200201200220021 - 26 = 200201200219957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200201200219978 and 200201200220005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200201200220029) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 452270180 + ... + 452712621.
It is an arithmetic number, because the mean of its divisors is an integer number (5962026699576).
Almost surely, 2200201200220021 is an apocalyptic number.
It is an amenable number.
200201200220021 is a deficient number, since it is larger than the sum of its proper divisors (85976081359627).
200201200220021 is a wasteful number, since it uses less digits than its factorization.
200201200220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 904982862 (or 904982849 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200201200220021 its reverse (120022002102002), we get a palindrome (320223202322023).
The spelling of 200201200220021 in words is "two hundred trillion, two hundred one billion, two hundred million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •