Base | Representation |
---|---|
bin | 1000001010100000001… |
… | …0001110000010011110 |
3 | 111102000211101002202002 |
4 | 2002220002032002132 |
5 | 4244222033420200 |
6 | 144233402002302 |
7 | 13063504146311 |
oct | 2025002160236 |
9 | 442024332662 |
10 | 140258107550 |
11 | 54535055170 |
12 | 232241a6392 |
13 | 102c31b2a62 |
14 | 6b07a18978 |
15 | 39ad707bd5 |
hex | 20a808e09e |
140258107550 has 24 divisors (see below), whose sum is σ = 284596452072. Its totient is φ = 51002948000.
The previous prime is 140258107541. The next prime is 140258107603. The reversal of 140258107550 is 55701852041.
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 127506821 + ... + 127507920.
It is an arithmetic number, because the mean of its divisors is an integer number (11858185503).
Almost surely, 2140258107550 is an apocalyptic number.
140258107550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140258107550 is an abundant number, since it is smaller than the sum of its proper divisors (144338344522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140258107550 is a wasteful number, since it uses less digits than its factorization.
140258107550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255014764 (or 255014759 counting only the distinct ones).
The product of its (nonzero) digits is 56000, while the sum is 38.
Adding to 140258107550 its reverse (55701852041), we get a palindrome (195959959591).
The spelling of 140258107550 in words is "one hundred forty billion, two hundred fifty-eight million, one hundred seven thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •