Base | Representation |
---|---|
bin | 11011010010100011001101… |
… | …010101100110011100100001 |
3 | 120201221222210022120100010020 |
4 | 123102203031111212130201 |
5 | 111212420034321024301 |
6 | 1103133203431224053 |
7 | 34165206215431053 |
oct | 3322431525463441 |
9 | 521858708510106 |
10 | 120022011111201 |
11 | 3527405a339901 |
12 | 115650a0818029 |
13 | 51c804766c224 |
14 | 218d14c4a38d3 |
15 | dd20abc2b436 |
hex | 6d28cd566721 |
120022011111201 has 8 divisors (see below), whose sum is σ = 160036527338784. Its totient is φ = 80011084478880.
The previous prime is 120022011111181. The next prime is 120022011111263. The reversal of 120022011111201 is 102111110220021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120022011111201 - 225 = 120021977556769 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120022011111601) 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, 897320796 + ... + 897454541.
It is an arithmetic number, because the mean of its divisors is an integer number (20004565917348).
Almost surely, 2120022011111201 is an apocalyptic number.
It is an amenable number.
120022011111201 is a deficient number, since it is larger than the sum of its proper divisors (40014516227583).
120022011111201 is a wasteful number, since it uses less digits than its factorization.
120022011111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1794797631.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 120022011111201 its reverse (102111110220021), we get a palindrome (222133121331222).
The spelling of 120022011111201 in words is "one hundred twenty trillion, twenty-two billion, eleven million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •