Base | Representation |
---|---|
bin | 11011010101001001111010… |
… | …100100110100111011111101 |
3 | 120202121002211010212000210122 |
4 | 123111021322210310323331 |
5 | 111223333132333021341 |
6 | 1103351325432544325 |
7 | 34214144053313111 |
oct | 3325117244647375 |
9 | 522532733760718 |
10 | 120201011220221 |
11 | 35332a652220a8 |
12 | 115939175520a5 |
13 | 520bba30b40b9 |
14 | 2197a8d57d741 |
15 | dd6a8677594b |
hex | 6d527a934efd |
120201011220221 has 32 divisors (see below), whose sum is σ = 125721853488000. Its totient is φ = 114820155648000.
The previous prime is 120201011220211. The next prime is 120201011220247. The reversal of 120201011220221 is 122022110102021.
It is a cyclic number.
It is not a de Polignac number, because 120201011220221 - 210 = 120201011219197 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 120201011220221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120201011220211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 743686706 + ... + 743848316.
It is an arithmetic number, because the mean of its divisors is an integer number (3928807921500).
Almost surely, 2120201011220221 is an apocalyptic number.
It is an amenable number.
120201011220221 is a deficient number, since it is larger than the sum of its proper divisors (5520842267779).
120201011220221 is a wasteful number, since it uses less digits than its factorization.
120201011220221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162941.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 120201011220221 its reverse (122022110102021), we get a palindrome (242223121322242).
The spelling of 120201011220221 in words is "one hundred twenty trillion, two hundred one billion, eleven million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •