Base | Representation |
---|---|
bin | 10000110000110… |
… | …11010011110001 |
3 | 100210121021210201 |
4 | 20120123103301 |
5 | 241444333131 |
6 | 21541555201 |
7 | 3325154611 |
oct | 1030332361 |
9 | 323537721 |
10 | 140621041 |
11 | 72416740 |
12 | 3b115b01 |
13 | 23196c22 |
14 | 14966a41 |
15 | c52a761 |
hex | 861b4f1 |
140621041 has 4 divisors (see below), whose sum is σ = 153404784. Its totient is φ = 127837300.
The previous prime is 140621023. The next prime is 140621069. The reversal of 140621041 is 140126041.
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 140621041 - 217 = 140489969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140621441) 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 3 ways as a sum of consecutive naturals, for example, 6391855 + ... + 6391876.
It is an arithmetic number, because the mean of its divisors is an integer number (38351196).
Almost surely, 2140621041 is an apocalyptic number.
140621041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140621041 is a deficient number, since it is larger than the sum of its proper divisors (12783743).
140621041 is a wasteful number, since it uses less digits than its factorization.
140621041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12783742.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 140621041 is about 11858.3742983598. The cubic root of 140621041 is about 520.0160756865.
Adding to 140621041 its reverse (140126041), we get a palindrome (280747082).
The spelling of 140621041 in words is "one hundred forty million, six hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •