Base | Representation |
---|---|
bin | 110111111101001000… |
… | …1111001011001010111 |
3 | 102111011101002120211110 |
4 | 1233322101321121113 |
5 | 3432043224100120 |
6 | 131111400310103 |
7 | 11452516414104 |
oct | 1577221713127 |
9 | 374141076743 |
10 | 120163112535 |
11 | 46a62a42a74 |
12 | 1b356472333 |
13 | b43cc2776b |
14 | 5b5cc85aab |
15 | 31d44752e0 |
hex | 1bfa479657 |
120163112535 has 16 divisors (see below), whose sum is σ = 192945189600. Its totient is φ = 63858923520.
The previous prime is 120163112533. The next prime is 120163112539. The reversal of 120163112535 is 535211361021.
It is not a de Polignac number, because 120163112535 - 21 = 120163112533 is a prime.
It is a super-2 number, since 2×1201631125352 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120163112533) 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 15 ways as a sum of consecutive naturals, for example, 14250010 + ... + 14258439.
It is an arithmetic number, because the mean of its divisors is an integer number (12059074350).
Almost surely, 2120163112535 is an apocalyptic number.
120163112535 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
120163112535 is a deficient number, since it is larger than the sum of its proper divisors (72782077065).
120163112535 is a wasteful number, since it uses less digits than its factorization.
120163112535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28508738.
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 120163112535 its reverse (535211361021), we get a palindrome (655374473556).
The spelling of 120163112535 in words is "one hundred twenty billion, one hundred sixty-three million, one hundred twelve thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •