Base | Representation |
---|---|
bin | 11011010100010101110011… |
… | …010101010111100110011110 |
3 | 120202101202101110122021022120 |
4 | 123110111303111113212132 |
5 | 111221424033104340132 |
6 | 1103305513144123410 |
7 | 34210123316505420 |
oct | 3324256325274636 |
9 | 522352343567276 |
10 | 120145055152542 |
11 | 35311260505272 |
12 | 11584abba66566 |
13 | 52068263bac94 |
14 | 21950a1bd8810 |
15 | dd53ae07502c |
hex | 6d457355799e |
120145055152542 has 16 divisors (see below), whose sum is σ = 274617268920192. Its totient is φ = 34327158615000.
The previous prime is 120145055152519. The next prime is 120145055152559. The reversal of 120145055152542 is 245251550541021.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 2860596551251 = 120145055152542 / (1 + 2 + 0 + 1 + 4 + 5 + 0 + 5 + 5 + 1 + 5 + 2 + 5 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 120145055152494 and 120145055152503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1430298275584 + ... + 1430298275667.
It is an arithmetic number, because the mean of its divisors is an integer number (17163579307512).
Almost surely, 2120145055152542 is an apocalyptic number.
120145055152542 is an abundant number, since it is smaller than the sum of its proper divisors (154472213767650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120145055152542 is a wasteful number, since it uses less digits than its factorization.
120145055152542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2860596551263.
The product of its (nonzero) digits is 400000, while the sum is 42.
The spelling of 120145055152542 in words is "one hundred twenty trillion, one hundred forty-five billion, fifty-five million, one hundred fifty-two thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •