Base | Representation |
---|---|
bin | 1000001010011010101… |
… | …0010000110111001000 |
3 | 111101222012222200100001 |
4 | 2002212222100313020 |
5 | 4244200133103230 |
6 | 144231215452344 |
7 | 13063104155362 |
oct | 2024652206710 |
9 | 441865880301 |
10 | 140235050440 |
11 | 54523037001 |
12 | 232185270b4 |
13 | 102bb49bcb4 |
14 | 6b04935d32 |
15 | 39ab6a10ca |
hex | 20a6a90dc8 |
140235050440 has 32 divisors (see below), whose sum is σ = 316667981880. Its totient is φ = 55891510272.
The previous prime is 140235050437. The next prime is 140235050453. The reversal of 140235050440 is 44050532041.
140235050440 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 106081792804 + 34153257636 = 325702^2 + 184806^2 .
It is a junction number, because it is equal to n+sod(n) for n = 140235050399 and 140235050408.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6317217 + ... + 6339376.
Almost surely, 2140235050440 is an apocalyptic number.
140235050440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140235050440 is an abundant number, since it is smaller than the sum of its proper divisors (176432931440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140235050440 is a wasteful number, since it uses less digits than its factorization.
140235050440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12656881 (or 12656877 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 28.
Adding to 140235050440 its reverse (44050532041), we get a palindrome (184285582481).
The spelling of 140235050440 in words is "one hundred forty billion, two hundred thirty-five million, fifty thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •