Base | Representation |
---|---|
bin | 1000001010000110010… |
… | …1110100110011011111 |
3 | 111101202021221201020201 |
4 | 2002201211310303133 |
5 | 4244011400011423 |
6 | 144214540524331 |
7 | 13061022231415 |
oct | 2024145646337 |
9 | 441667851221 |
10 | 140150000863 |
11 | 5448a026aa4 |
12 | 231b3b506a7 |
13 | 102a69913c2 |
14 | 6ad75172b5 |
15 | 39a3ea12ad |
hex | 20a1974cdf |
140150000863 has 4 divisors (see below), whose sum is σ = 140150749648. Its totient is φ = 140149252080.
The previous prime is 140150000843. The next prime is 140150000873. The reversal of 140150000863 is 368000051041.
140150000863 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 140150000863 - 29 = 140150000351 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140150000833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 180595 + ... + 559387.
It is an arithmetic number, because the mean of its divisors is an integer number (35037687412).
Almost surely, 2140150000863 is an apocalyptic number.
140150000863 is a deficient number, since it is larger than the sum of its proper divisors (748785).
140150000863 is an equidigital number, since it uses as much as digits as its factorization.
140150000863 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 748784.
The product of its (nonzero) digits is 2880, while the sum is 28.
The spelling of 140150000863 in words is "one hundred forty billion, one hundred fifty million, eight hundred sixty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •