Base | Representation |
---|---|
bin | 110111111110110101… |
… | …1101101011100111001 |
3 | 102111022100112111012110 |
4 | 1233331223231130321 |
5 | 3432202333223001 |
6 | 131121200202533 |
7 | 11454111634662 |
oct | 1577553553471 |
9 | 374270474173 |
10 | 120220211001 |
11 | 46a921a1990 |
12 | 1b371609449 |
13 | b44b9c9b37 |
14 | 5b666aa369 |
15 | 31d94a33d6 |
hex | 1bfdaed739 |
120220211001 has 32 divisors (see below), whose sum is σ = 175996800000. Its totient is φ = 72389890880.
The previous prime is 120220210997. The next prime is 120220211053. The reversal of 120220211001 is 100112022021.
It is a cyclic number.
It is not a de Polignac number, because 120220211001 - 22 = 120220210997 is a prime.
It is a super-2 number, since 2×1202202110012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (120220211071) 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, 16027750 + ... + 16035248.
It is an arithmetic number, because the mean of its divisors is an integer number (5499900000).
Almost surely, 2120220211001 is an apocalyptic number.
120220211001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120220211001 is a deficient number, since it is larger than the sum of its proper divisors (55776588999).
120220211001 is a wasteful number, since it uses less digits than its factorization.
120220211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10589.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 120220211001 its reverse (100112022021), we get a palindrome (220332233022).
It can be divided in two parts, 12022021 and 1001, that multiplied together give a palindrome (12034043021).
The spelling of 120220211001 in words is "one hundred twenty billion, two hundred twenty million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •