Base | Representation |
---|---|
bin | 1000001001101110111… |
… | …1000001111010001000 |
3 | 111101111110002002010201 |
4 | 2002123233001322020 |
5 | 4243311222004121 |
6 | 144201111021544 |
7 | 13055420144335 |
oct | 2023357017210 |
9 | 441443062121 |
10 | 140051750536 |
11 | 54439620085 |
12 | 2318706a8b4 |
13 | 1028c511109 |
14 | 6ac845d98c |
15 | 399a544e91 |
hex | 209bbc1e88 |
140051750536 has 32 divisors (see below), whose sum is σ = 263089180800. Its totient is φ = 69894740160.
The previous prime is 140051750477. The next prime is 140051750537. The reversal of 140051750536 is 635057150041.
It is a super-2 number, since 2×1400517505362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140051750495 and 140051750504.
It is not an unprimeable number, because it can be changed into a prime (140051750537) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 14083326 + ... + 14093266.
It is an arithmetic number, because the mean of its divisors is an integer number (8221536900).
Almost surely, 2140051750536 is an apocalyptic number.
It is an amenable number.
140051750536 is a deficient number, since it is larger than the sum of its proper divisors (123037430264).
140051750536 is a wasteful number, since it uses less digits than its factorization.
140051750536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13069 (or 13065 counting only the distinct ones).
The product of its (nonzero) digits is 63000, while the sum is 37.
The spelling of 140051750536 in words is "one hundred forty billion, fifty-one million, seven hundred fifty thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •