Base | Representation |
---|---|
bin | 11011010101010011001110… |
… | …100111000010010011100001 |
3 | 120202122001122001020111021110 |
4 | 123111103032213002103201 |
5 | 111224014122310120001 |
6 | 1103400102011213533 |
7 | 34214646626232246 |
oct | 3325231647022341 |
9 | 522561561214243 |
10 | 120211011020001 |
11 | 3533722690a740 |
12 | 115958484472a9 |
13 | 520cb07a313a5 |
14 | 219835b68d5cd |
15 | dd6e6e5e43d6 |
hex | 6d54ce9c24e1 |
120211011020001 has 64 divisors (see below), whose sum is σ = 187107159396096. Its totient is φ = 67841163264000.
The previous prime is 120211011019997. The next prime is 120211011020011. The reversal of 120211011020001 is 100020110112021.
It is not a de Polignac number, because 120211011020001 - 22 = 120211011019997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120211011020011) 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 63 ways as a sum of consecutive naturals, for example, 77022945 + ... + 78568161.
It is an arithmetic number, because the mean of its divisors is an integer number (2923549365564).
Almost surely, 2120211011020001 is an apocalyptic number.
120211011020001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120211011020001 is a deficient number, since it is larger than the sum of its proper divisors (66896148376095).
120211011020001 is a wasteful number, since it uses less digits than its factorization.
120211011020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1546722.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120211011020001 its reverse (100020110112021), we get a palindrome (220231121132022).
The spelling of 120211011020001 in words is "one hundred twenty trillion, two hundred eleven billion, eleven million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •