Base | Representation |
---|---|
bin | 11011010101001001001011… |
… | …100010111101010010101000 |
3 | 120202121000210011011200220112 |
4 | 123111021023202331102220 |
5 | 111223330023340413000 |
6 | 1103351115245313452 |
7 | 34214115362622404 |
oct | 3325111342752250 |
9 | 522530704150815 |
10 | 120200222201000 |
11 | 3533269a9012a7 |
12 | 11593737265888 |
13 | 520baa87a7316 |
14 | 2197a16872104 |
15 | dd6a3c36c235 |
hex | 6d524b8bd4a8 |
120200222201000 has 64 divisors (see below), whose sum is σ = 281322528786000. Its totient is φ = 48070856601600.
The previous prime is 120200222200957. The next prime is 120200222201083. The reversal of 120200222201000 is 102222002021.
It can be written as a sum of positive squares in 8 ways, for example, as 64989942749956 + 55210279451044 = 8061634^2 + 7430362^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6328745 + ... + 16746744.
Almost surely, 2120200222201000 is an apocalyptic number.
120200222201000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120200222201000 is an abundant number, since it is smaller than the sum of its proper divisors (161122306585000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120200222201000 is a wasteful number, since it uses less digits than its factorization.
120200222201000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23080719 (or 23080705 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 120200222201000 its reverse (102222002021), we get a palindrome (120302444203021).
The spelling of 120200222201000 in words is "one hundred twenty trillion, two hundred billion, two hundred twenty-two million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •