Base | Representation |
---|---|
bin | 1000001010010110000… |
… | …1111110011010101000 |
3 | 111101220220022220221011 |
4 | 2002211201332122220 |
5 | 4244130310204040 |
6 | 144225301353304 |
7 | 13062454121656 |
oct | 2024541763250 |
9 | 441826286834 |
10 | 140216100520 |
11 | 54513373711 |
12 | 23212108834 |
13 | 102b7595822 |
14 | 6b02201dd6 |
15 | 39a9bab3ea |
hex | 20a587e6a8 |
140216100520 has 16 divisors (see below), whose sum is σ = 315486226260. Its totient is φ = 56086440192.
The previous prime is 140216100509. The next prime is 140216100569. The reversal of 140216100520 is 25001612041.
It can be written as a sum of positive squares in 2 ways, for example, as 135899873316 + 4316227204 = 368646^2 + 65698^2 .
It is a junction number, because it is equal to n+sod(n) for n = 140216100491 and 140216100500.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1752701217 + ... + 1752701296.
Almost surely, 2140216100520 is an apocalyptic number.
140216100520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140216100520 is an abundant number, since it is smaller than the sum of its proper divisors (175270125740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140216100520 is a wasteful number, since it uses less digits than its factorization.
140216100520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3505402524 (or 3505402520 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 140216100520 its reverse (25001612041), we get a palindrome (165217712561).
The spelling of 140216100520 in words is "one hundred forty billion, two hundred sixteen million, one hundred thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •