Base | Representation |
---|---|
bin | 1001100100100… |
… | …0101100100011 |
3 | 2210112111201220 |
4 | 2121020230203 |
5 | 40234044101 |
6 | 3552230123 |
7 | 665133612 |
oct | 231105443 |
9 | 83474656 |
10 | 40143651 |
11 | 20729579 |
12 | 1153b343 |
13 | 8417052 |
14 | 548d879 |
15 | 37ce636 |
hex | 2648b23 |
40143651 has 4 divisors (see below), whose sum is σ = 53524872. Its totient is φ = 26762432.
The previous prime is 40143641. The next prime is 40143661. The reversal of 40143651 is 15634104.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (40143641) and next prime (40143661).
It is a cyclic number.
It is not a de Polignac number, because 40143651 - 215 = 40110883 is a prime.
It is a super-2 number, since 2×401436512 = 3223025431219602, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (40143601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6690606 + ... + 6690611.
It is an arithmetic number, because the mean of its divisors is an integer number (13381218).
Almost surely, 240143651 is an apocalyptic number.
40143651 is a deficient number, since it is larger than the sum of its proper divisors (13381221).
40143651 is a wasteful number, since it uses less digits than its factorization.
40143651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13381220.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 40143651 is about 6335.9017511322. The cubic root of 40143651 is about 342.4040998132.
Adding to 40143651 its reverse (15634104), we get a palindrome (55777755).
The spelling of 40143651 in words is "forty million, one hundred forty-three thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •