Base | Representation |
---|---|
bin | 10000110000011… |
… | …10111011100101 |
3 | 100210111201020221 |
4 | 20120032323211 |
5 | 241441222331 |
6 | 21540524341 |
7 | 3324554032 |
oct | 1030167345 |
9 | 323451227 |
10 | 140570341 |
11 | 7239163a |
12 | 3b0b06b1 |
13 | 23179b22 |
14 | 14952389 |
15 | c51a711 |
hex | 860eee5 |
140570341 has 4 divisors (see below), whose sum is σ = 147968800. Its totient is φ = 133171884.
The previous prime is 140570327. The next prime is 140570347. The reversal of 140570341 is 143075041.
140570341 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 140570341 - 29 = 140569829 is a prime.
It is a super-3 number, since 3×1405703413 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140570347) 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, 3699201 + ... + 3699238.
It is an arithmetic number, because the mean of its divisors is an integer number (36992200).
Almost surely, 2140570341 is an apocalyptic number.
It is an amenable number.
140570341 is a deficient number, since it is larger than the sum of its proper divisors (7398459).
140570341 is an equidigital number, since it uses as much as digits as its factorization.
140570341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7398458.
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 140570341 is about 11856.2363758488. The cubic root of 140570341 is about 519.9535720383.
The spelling of 140570341 in words is "one hundred forty million, five hundred seventy thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •