Base | Representation |
---|---|
bin | 1000001101001001011… |
… | …0001111110110001011 |
3 | 111110212022011102100122 |
4 | 2003102112033312023 |
5 | 4302200302012112 |
6 | 144432041253455 |
7 | 13120214144246 |
oct | 2032226176613 |
9 | 443768142318 |
10 | 140968000907 |
11 | 54869841598 |
12 | 233a1a9428b |
13 | 103a72a72b6 |
14 | 6b7400a25d |
15 | 3a00bd1872 |
hex | 20d258fd8b |
140968000907 has 4 divisors (see below), whose sum is σ = 141103678560. Its totient is φ = 140832323256.
The previous prime is 140968000889. The next prime is 140968000961. The reversal of 140968000907 is 709000869041.
140968000907 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.
It is a cyclic number.
It is not a de Polignac number, because 140968000907 - 28 = 140968000651 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140968000507) 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, 67837268 + ... + 67839345.
It is an arithmetic number, because the mean of its divisors is an integer number (35275919640).
Almost surely, 2140968000907 is an apocalyptic number.
140968000907 is a deficient number, since it is larger than the sum of its proper divisors (135677653).
140968000907 is a wasteful number, since it uses less digits than its factorization.
140968000907 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135677652.
The product of its (nonzero) digits is 108864, while the sum is 44.
Adding to 140968000907 its reverse (709000869041), we get a palindrome (849968869948).
The spelling of 140968000907 in words is "one hundred forty billion, nine hundred sixty-eight million, nine hundred seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •