Base | Representation |
---|---|
bin | 1011000001011110100110… |
… | …0111100010111100100101 |
3 | 1120220122220012000121002212 |
4 | 2300113221213202330211 |
5 | 3042033301140400401 |
6 | 41435510014213205 |
7 | 2360433306616154 |
oct | 260275147427445 |
9 | 46818805017085 |
10 | 12120022200101 |
11 | 3953088622212 |
12 | 1438b36ab4205 |
13 | 69bbb437a8ba |
14 | 2dc87dc6359b |
15 | 160409d0ddbb |
hex | b05e99e2f25 |
12120022200101 has 8 divisors (see below), whose sum is σ = 12151389238560. Its totient is φ = 12088656240208.
The previous prime is 12120022200061. The next prime is 12120022200161. The reversal of 12120022200101 is 10100222002121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12120022200101 - 26 = 12120022200037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120022200161) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 25385750 + ... + 25858776.
It is an arithmetic number, because the mean of its divisors is an integer number (1518923654820).
Almost surely, 212120022200101 is an apocalyptic number.
It is an amenable number.
12120022200101 is a deficient number, since it is larger than the sum of its proper divisors (31367038459).
12120022200101 is an equidigital number, since it uses as much as digits as its factorization.
12120022200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539283.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12120022200101 its reverse (10100222002121), we get a palindrome (22220244202222).
The spelling of 12120022200101 in words is "twelve trillion, one hundred twenty billion, twenty-two million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •