Base | Representation |
---|---|
bin | 11011010101011101011110… |
… | …010100011100111011010000 |
3 | 120202200010000201112021120012 |
4 | 123111131132110130323100 |
5 | 111224204140033031000 |
6 | 1103405121352334052 |
7 | 34215516350105126 |
oct | 3325353624347320 |
9 | 522603021467505 |
10 | 120222012002000 |
11 | 353409616592a7 |
12 | 115979b86a4328 |
13 | 5210b6bc109ac |
14 | 2198ac2737916 |
15 | dd73b52c9735 |
hex | 6d575e51ced0 |
120222012002000 has 40 divisors (see below), whose sum is σ = 290696825025672. Its totient is φ = 48088804800000.
The previous prime is 120222012001969. The next prime is 120222012002161. The reversal of 120222012002000 is 200210222021.
It can be written as a sum of positive squares in 4 ways, for example, as 161867819584 + 120060144182416 = 402328^2 + 10957196^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30055501001 + ... + 30055505000.
Almost surely, 2120222012002000 is an apocalyptic number.
120222012002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120222012002000 is an abundant number, since it is smaller than the sum of its proper divisors (170474813023672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120222012002000 is an equidigital number, since it uses as much as digits as its factorization.
120222012002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60111006024 (or 60111006008 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 120222012002000 its reverse (200210222021), we get a palindrome (120422222224021).
The spelling of 120222012002000 in words is "one hundred twenty trillion, two hundred twenty-two billion, twelve million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •