Base | Representation |
---|---|
bin | 110111111100100000… |
… | …1011001100000101011 |
3 | 102111002220101111011022 |
4 | 1233321001121200223 |
5 | 3432022323313121 |
6 | 131105324123055 |
7 | 11452142144633 |
oct | 1577101314053 |
9 | 374086344138 |
10 | 120142010411 |
11 | 46a5203a6a5 |
12 | 1b34b39648b |
13 | b4387497b7 |
14 | 5b5a1516c3 |
15 | 31d26a7aab |
hex | 1bf905982b |
120142010411 has 24 divisors (see below), whose sum is σ = 129130536480. Its totient is φ = 111746304000.
The previous prime is 120142010407. The next prime is 120142010423. The reversal of 120142010411 is 114010241021.
It is not a de Polignac number, because 120142010411 - 22 = 120142010407 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120142010411.
It is not an unprimeable number, because it can be changed into a prime (120142010441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12627146 + ... + 12636656.
It is an arithmetic number, because the mean of its divisors is an integer number (5380439020).
Almost surely, 2120142010411 is an apocalyptic number.
120142010411 is a deficient number, since it is larger than the sum of its proper divisors (8988526069).
120142010411 is a wasteful number, since it uses less digits than its factorization.
120142010411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10055 (or 10038 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 120142010411 its reverse (114010241021), we get a palindrome (234152251432).
The spelling of 120142010411 in words is "one hundred twenty billion, one hundred forty-two million, ten thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •