Base | Representation |
---|---|
bin | 11011010010011010110100… |
… | …110101100110000001110111 |
3 | 120201221010120000122021102100 |
4 | 123102122310311212001313 |
5 | 111212243121043224421 |
6 | 1103125114333113143 |
7 | 34164440161404324 |
oct | 3322326465460167 |
9 | 521833500567370 |
10 | 120013010133111 |
11 | 3527026053a837 |
12 | 115633aa3287b3 |
13 | 51c72419389a4 |
14 | 218c936cb5b4b |
15 | dd1c31909c26 |
hex | 6d26b4d66077 |
120013010133111 has 6 divisors (see below), whose sum is σ = 173352125747840. Its totient is φ = 80008673422068.
The previous prime is 120013010133101. The next prime is 120013010133113. The reversal of 120013010133111 is 111331010310021.
120013010133111 is a `hidden beast` number, since 1 + 20 + 0 + 1 + 301 + 0 + 1 + 331 + 11 = 666.
It is not a de Polignac number, because 120013010133111 - 29 = 120013010132599 is a prime.
It is a super-3 number, since 3×1200130101331113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120013010133113) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6667389451831 + ... + 6667389451848.
Almost surely, 2120013010133111 is an apocalyptic number.
120013010133111 is a deficient number, since it is larger than the sum of its proper divisors (53339115614729).
120013010133111 is a wasteful number, since it uses less digits than its factorization.
120013010133111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13334778903685 (or 13334778903682 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 120013010133111 its reverse (111331010310021), we get a palindrome (231344020443132).
The spelling of 120013010133111 in words is "one hundred twenty trillion, thirteen billion, ten million, one hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •