Base | Representation |
---|---|
bin | 11011010010010000100100… |
… | …101001111011010111101110 |
3 | 120201220002010210102121012112 |
4 | 123102100210221323113232 |
5 | 111212103044303033402 |
6 | 1103120054110004022 |
7 | 34163600313243050 |
oct | 3322204451732756 |
9 | 521802123377175 |
10 | 120002001221102 |
11 | 35266621275250 |
12 | 115612374a6612 |
13 | 51c61a8c10a80 |
14 | 218c1b0b658d0 |
15 | dd17da1a9e52 |
hex | 6d2424a7b5ee |
120002001221102 has 64 divisors (see below), whose sum is σ = 241684545360384. Its totient is φ = 43157171226240.
The previous prime is 120002001221027. The next prime is 120002001221107. The reversal of 120002001221102 is 201122100200021.
120002001221102 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120002001221107) 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, 307157828 + ... + 307548264.
It is an arithmetic number, because the mean of its divisors is an integer number (3776321021256).
Almost surely, 2120002001221102 is an apocalyptic number.
120002001221102 is an abundant number, since it is smaller than the sum of its proper divisors (121682544139282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120002001221102 is a wasteful number, since it uses less digits than its factorization.
120002001221102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543993.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120002001221102 its reverse (201122100200021), we get a palindrome (321124101421123).
The spelling of 120002001221102 in words is "one hundred twenty trillion, two billion, one million, two hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •