Base | Representation |
---|---|
bin | 101101011110101100010000… |
… | …100100110010011000001001 |
3 | 222020012211200100012201011102 |
4 | 231132230100210302120021 |
5 | 202204121404201133001 |
6 | 1545224245403311145 |
7 | 60063024541445102 |
oct | 5536542044623011 |
9 | 866184610181142 |
10 | 200021200021001 |
11 | 58807572962967 |
12 | 1a52554721b4b5 |
13 | 877bbc24676c8 |
14 | 37571134433a9 |
15 | 181d02534be6b |
hex | b5eb10932609 |
200021200021001 has 12 divisors (see below), whose sum is σ = 207226969909200. Its totient is φ = 193058167002120.
The previous prime is 200021200020997. The next prime is 200021200021081. The reversal of 200021200021001 is 100120002120002.
It is a happy number.
It is not a de Polignac number, because 200021200021001 - 22 = 200021200020997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200021200021081) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 274224971 + ... + 274953408.
It is an arithmetic number, because the mean of its divisors is an integer number (17268914159100).
Almost surely, 2200021200021001 is an apocalyptic number.
It is an amenable number.
200021200021001 is a deficient number, since it is larger than the sum of its proper divisors (7205769888199).
200021200021001 is an equidigital number, since it uses as much as digits as its factorization.
200021200021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549178820 (or 549178789 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200021200021001 its reverse (100120002120002), we get a palindrome (300141202141003).
It can be divided in two parts, 20002120002 and 1001, that multiplied together give a palindrome (20022122122002).
The spelling of 200021200021001 in words is "two hundred trillion, twenty-one billion, two hundred million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •