Base | Representation |
---|---|
bin | 110111111100111001… |
… | …1000001111101010110 |
3 | 102111010210212111112020 |
4 | 1233321303001331112 |
5 | 3432034141134032 |
6 | 131110511034010 |
7 | 11452360554042 |
oct | 1577163017526 |
9 | 374123774466 |
10 | 120155021142 |
11 | 46a59416872 |
12 | 1b35380b906 |
13 | b43b353860 |
14 | 5b5bb7b022 |
15 | 31d38c7b2c |
hex | 1bf9cc1f56 |
120155021142 has 128 divisors (see below), whose sum is σ = 273128841216. Its totient is φ = 34962250752.
The previous prime is 120155021137. The next prime is 120155021143. The reversal of 120155021142 is 241120551021.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120155021143) 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, 62808778 + ... + 62810690.
It is an arithmetic number, because the mean of its divisors is an integer number (2133819072).
Almost surely, 2120155021142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120155021142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136564420608).
120155021142 is an abundant number, since it is smaller than the sum of its proper divisors (152973820074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120155021142 is a wasteful number, since it uses less digits than its factorization.
120155021142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2334.
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 120155021142 its reverse (241120551021), we get a palindrome (361275572163).
The spelling of 120155021142 in words is "one hundred twenty billion, one hundred fifty-five million, twenty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •