Base | Representation |
---|---|
bin | 11011010010010000100101… |
… | …001111111111111001010111 |
3 | 120201220002011111012122012111 |
4 | 123102100211033333321113 |
5 | 111212103104331413421 |
6 | 1103120055103531451 |
7 | 34163600464130224 |
oct | 3322204517777127 |
9 | 521802144178174 |
10 | 120002011201111 |
11 | 35266626971396 |
12 | 1156123a8b9b87 |
13 | 51c61aacc64c0 |
14 | 218c1b220294b |
15 | dd17daecbee1 |
hex | 6d24253ffe57 |
120002011201111 has 32 divisors (see below), whose sum is σ = 133925590149120. Its totient is φ = 106836078795264.
The previous prime is 120002011201109. The next prime is 120002011201117. The reversal of 120002011201111 is 111102110200021.
It is a happy number.
It is not a de Polignac number, because 120002011201111 - 21 = 120002011201109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120002011201091 and 120002011201100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120002011201117) 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, 3246981 + ... + 15828673.
It is an arithmetic number, because the mean of its divisors is an integer number (4185174692160).
Almost surely, 2120002011201111 is an apocalyptic number.
120002011201111 is a deficient number, since it is larger than the sum of its proper divisors (13923578948009).
120002011201111 is a wasteful number, since it uses less digits than its factorization.
120002011201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12581995.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 120002011201111 its reverse (111102110200021), we get a palindrome (231104121401132).
The spelling of 120002011201111 in words is "one hundred twenty trillion, two billion, eleven million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •