Base | Representation |
---|---|
bin | 10000101111100… |
… | …00011010010011 |
3 | 100210021100202221 |
4 | 20113300122103 |
5 | 241423222311 |
6 | 21534121511 |
7 | 3323523415 |
oct | 1027603223 |
9 | 323240687 |
10 | 140445331 |
11 | 72306724 |
12 | 3b050297 |
13 | 23134c60 |
14 | 1491c9b5 |
15 | c4e3671 |
hex | 85f0693 |
140445331 has 8 divisors (see below), whose sum is σ = 153164480. Its totient is φ = 127999872.
The previous prime is 140445329. The next prime is 140445367. The reversal of 140445331 is 133544041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140445331 - 21 = 140445329 is a prime.
It is a super-2 number, since 2×1404453312 = 39449781999399122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140445296 and 140445305.
It is not an unprimeable number, because it can be changed into a prime (140445391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67350 + ... + 69403.
It is an arithmetic number, because the mean of its divisors is an integer number (19145560).
Almost surely, 2140445331 is an apocalyptic number.
140445331 is a deficient number, since it is larger than the sum of its proper divisors (12719149).
140445331 is a wasteful number, since it uses less digits than its factorization.
140445331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136845.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 140445331 is about 11850.9632941799. The cubic root of 140445331 is about 519.7993937737.
Adding to 140445331 its reverse (133544041), we get a palindrome (273989372).
The spelling of 140445331 in words is "one hundred forty million, four hundred forty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •