Base | Representation |
---|---|
bin | 11011010101010010011110… |
… | …010010000101100111111001 |
3 | 120202121222112112120200210022 |
4 | 123111102132102011213321 |
5 | 111224010442224102301 |
6 | 1103355445325100225 |
7 | 34214620552454255 |
oct | 3325223622054771 |
9 | 522558475520708 |
10 | 120210200222201 |
11 | 35336950174311 |
12 | 115956609b7675 |
13 | 520ca08a6a78b |
14 | 21982c1b13265 |
15 | dd6e23337d1b |
hex | 6d549e4859f9 |
120210200222201 has 16 divisors (see below), whose sum is σ = 122258276494848. Its totient is φ = 118173031084800.
The previous prime is 120210200222179. The next prime is 120210200222213. The reversal of 120210200222201 is 102222002012021.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 120210200222201 - 226 = 120210133113337 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 120210200222201.
It is not an unprimeable number, because it can be changed into a prime (120210203222201) 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, 300410480 + ... + 300810366.
It is an arithmetic number, because the mean of its divisors is an integer number (7641142280928).
Almost surely, 2120210200222201 is an apocalyptic number.
It is an amenable number.
120210200222201 is a deficient number, since it is larger than the sum of its proper divisors (2048076272647).
120210200222201 is a wasteful number, since it uses less digits than its factorization.
120210200222201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413512.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 120210200222201 its reverse (102222002012021), we get a palindrome (222432202234222).
The spelling of 120210200222201 in words is "one hundred twenty trillion, two hundred ten billion, two hundred million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •