Base | Representation |
---|---|
bin | 11011010011110111000001… |
… | …110100100000100010111000 |
3 | 120202021121002122111100221220 |
4 | 123103313001310200202320 |
5 | 111220403400110400440 |
6 | 1103242410251032040 |
7 | 34204543430161233 |
oct | 3323670164404270 |
9 | 522247078440856 |
10 | 120112012200120 |
11 | 352a9244634026 |
12 | 1157a619a3b620 |
13 | 520368b783025 |
14 | 21936495a641a |
15 | dd45c82208d0 |
hex | 6d3dc1d208b8 |
120112012200120 has 64 divisors (see below), whose sum is σ = 381532274053920. Its totient is φ = 30145759924224.
The previous prime is 120112012200091. The next prime is 120112012200199. The reversal of 120112012200120 is 21002210211021.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 120112012200120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29439216637 + ... + 29439220716.
Almost surely, 2120112012200120 is an apocalyptic number.
120112012200120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120112012200120 is an abundant number, since it is smaller than the sum of its proper divisors (261420261853800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120112012200120 is a wasteful number, since it uses less digits than its factorization.
120112012200120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58878437384 (or 58878437380 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120112012200120 its reverse (21002210211021), we get a palindrome (141114222411141).
The spelling of 120112012200120 in words is "one hundred twenty trillion, one hundred twelve billion, twelve million, two hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •