Base | Representation |
---|---|
bin | 101101111110011001101000… |
… | …010110100111011011001001 |
3 | 222111221011010001211122220222 |
4 | 231332121220112213123021 |
5 | 203000322023101321301 |
6 | 1554013255455555425 |
7 | 60406324655260103 |
oct | 5576315026473311 |
9 | 874834101748828 |
10 | 202200221120201 |
11 | 594776a55231a7 |
12 | 1a817910b2bb75 |
13 | 88a95258b2975 |
14 | 37d0785ab4573 |
15 | 1859a59b1d31b |
hex | b7e6685a76c9 |
202200221120201 has 16 divisors (see below), whose sum is σ = 209127090574848. Its totient is φ = 195298683206400.
The previous prime is 202200221120143. The next prime is 202200221120251. The reversal of 202200221120201 is 102021122002202.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 202200221120201 - 26 = 202200221120137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 202200221120201.
It is not an unprimeable number, because it can be changed into a prime (202200221120251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191383745 + ... + 192437361.
It is an arithmetic number, because the mean of its divisors is an integer number (13070443160928).
Almost surely, 2202200221120201 is an apocalyptic number.
It is an amenable number.
202200221120201 is a deficient number, since it is larger than the sum of its proper divisors (6926869454647).
202200221120201 is a wasteful number, since it uses less digits than its factorization.
202200221120201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065632.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 202200221120201 its reverse (102021122002202), we get a palindrome (304221343122403).
The spelling of 202200221120201 in words is "two hundred two trillion, two hundred billion, two hundred twenty-one million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •