Base | Representation |
---|---|
bin | 1000001010110010000… |
… | …1111100101101100010 |
3 | 111102020002022011110011 |
4 | 2002230201330231202 |
5 | 4244400341042200 |
6 | 144245054355134 |
7 | 13065411233533 |
oct | 2025441745542 |
9 | 442202264404 |
10 | 140333534050 |
11 | 54573692216 |
12 | 232454bbaaa |
13 | 10305a01518 |
14 | 6b13a5068a |
15 | 39b51565ba |
hex | 20ac87cb62 |
140333534050 has 12 divisors (see below), whose sum is σ = 261020373426. Its totient is φ = 56133413600.
The previous prime is 140333534041. The next prime is 140333534059. The reversal of 140333534050 is 50435333041.
It is an interprime number because it is at equal distance from previous prime (140333534041) and next prime (140333534059).
It can be written as a sum of positive squares in 3 ways, for example, as 101737395369 + 38596138681 = 318963^2 + 196459^2 .
It is not an unprimeable number, because it can be changed into a prime (140333534059) 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 5 ways as a sum of consecutive naturals, for example, 1403335291 + ... + 1403335390.
Almost surely, 2140333534050 is an apocalyptic number.
140333534050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140333534050 is a deficient number, since it is larger than the sum of its proper divisors (120686839376).
140333534050 is a wasteful number, since it uses less digits than its factorization.
140333534050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2806670693 (or 2806670688 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 31.
Adding to 140333534050 its reverse (50435333041), we get a palindrome (190768867091).
The spelling of 140333534050 in words is "one hundred forty billion, three hundred thirty-three million, five hundred thirty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •