Base | Representation |
---|---|
bin | 10000110011011… |
… | …11100000010100 |
3 | 100211020210212120 |
4 | 20121233200110 |
5 | 242041402113 |
6 | 21553215540 |
7 | 3331122216 |
oct | 1031574024 |
9 | 324223776 |
10 | 140965908 |
11 | 72631856 |
12 | 3b2615b0 |
13 | 23287ba5 |
14 | 14a165b6 |
15 | c597a23 |
hex | 866f814 |
140965908 has 12 divisors (see below), whose sum is σ = 328920480. Its totient is φ = 46988632.
The previous prime is 140965889. The next prime is 140965933. The reversal of 140965908 is 809569041.
140965908 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 140965908.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5873568 + ... + 5873591.
It is an arithmetic number, because the mean of its divisors is an integer number (27410040).
Almost surely, 2140965908 is an apocalyptic number.
It is an amenable number.
140965908 is an abundant number, since it is smaller than the sum of its proper divisors (187954572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140965908 is a wasteful number, since it uses less digits than its factorization.
140965908 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11747166 (or 11747164 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 42.
The square root of 140965908 is about 11872.9064680894. The cubic root of 140965908 is about 520.4408342603.
The spelling of 140965908 in words is "one hundred forty million, nine hundred sixty-five thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •