Base | Representation |
---|---|
bin | 10000110010111… |
… | …10101000101011 |
3 | 100211010022002102 |
4 | 20121132220223 |
5 | 242032144221 |
6 | 21551524015 |
7 | 3330413606 |
oct | 1031365053 |
9 | 324108072 |
10 | 140896811 |
11 | 72594950 |
12 | 3b22960b |
13 | 232625c3 |
14 | 149d933d |
15 | c58230b |
hex | 865ea2b |
140896811 has 4 divisors (see below), whose sum is σ = 153705624. Its totient is φ = 128088000.
The previous prime is 140896801. The next prime is 140896823. The reversal of 140896811 is 118698041.
140896811 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 140896811 - 26 = 140896747 is a prime.
It is a super-2 number, since 2×1408968112 = 39703822699939442, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140896801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6404390 + ... + 6404411.
It is an arithmetic number, because the mean of its divisors is an integer number (38426406).
Almost surely, 2140896811 is an apocalyptic number.
140896811 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
140896811 is a deficient number, since it is larger than the sum of its proper divisors (12808813).
140896811 is a wasteful number, since it uses less digits than its factorization.
140896811 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12808812.
The product of its (nonzero) digits is 13824, while the sum is 38.
The square root of 140896811 is about 11869.9962510525. The cubic root of 140896811 is about 520.3557858538.
The spelling of 140896811 in words is "one hundred forty million, eight hundred ninety-six thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •