Base | Representation |
---|---|
bin | 110111111111011011… |
… | …1011010010000001011 |
3 | 102111100201212200110202 |
4 | 1233332313122100023 |
5 | 3432222423232212 |
6 | 131123145402415 |
7 | 11454442415051 |
oct | 1577667322013 |
9 | 374321780422 |
10 | 120240055307 |
11 | 46aa2416239 |
12 | 1b37819940b |
13 | b452b57428 |
14 | 5b691941d1 |
15 | 31db0c30c2 |
hex | 1bfedda40b |
120240055307 has 8 divisors (see below), whose sum is σ = 121044968352. Its totient is φ = 119435256000.
The previous prime is 120240055283. The next prime is 120240055319. The reversal of 120240055307 is 703550042021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120240055307 - 28 = 120240055051 is a prime.
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 120240055307.
It is not an unprimeable number, because it can be changed into a prime (120240015307) 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 7 ways as a sum of consecutive naturals, for example, 3841103 + ... + 3872279.
It is an arithmetic number, because the mean of its divisors is an integer number (15130621044).
Almost surely, 2120240055307 is an apocalyptic number.
120240055307 is a deficient number, since it is larger than the sum of its proper divisors (804913045).
120240055307 is a wasteful number, since it uses less digits than its factorization.
120240055307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56869.
The product of its (nonzero) digits is 8400, while the sum is 29.
Adding to 120240055307 its reverse (703550042021), we get a palindrome (823790097328).
The spelling of 120240055307 in words is "one hundred twenty billion, two hundred forty million, fifty-five thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •