Base | Representation |
---|---|
bin | 1001100100101… |
… | …1011000011011 |
3 | 2210120001211022 |
4 | 2121023120123 |
5 | 40234422101 |
6 | 3552353055 |
7 | 665210645 |
oct | 231133033 |
9 | 83501738 |
10 | 40154651 |
11 | 20736869 |
12 | 1154578b |
13 | 841c064 |
14 | 5493895 |
15 | 37d2a1b |
hex | 264b61b |
40154651 has 2 divisors, whose sum is σ = 40154652. Its totient is φ = 40154650.
The previous prime is 40154623. The next prime is 40154659. The reversal of 40154651 is 15645104.
40154651 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 40154651 - 210 = 40153627 is a prime.
It is a super-2 number, since 2×401546512 = 3224791993863602, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 40154651.
It is not a weakly prime, because it can be changed into another prime (40154659) 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 as a sum of consecutive naturals, namely, 20077325 + 20077326.
It is an arithmetic number, because the mean of its divisors is an integer number (20077326).
Almost surely, 240154651 is an apocalyptic number.
40154651 is a deficient number, since it is larger than the sum of its proper divisors (1).
40154651 is an equidigital number, since it uses as much as digits as its factorization.
40154651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 40154651 is about 6336.7697606904. The cubic root of 40154651 is about 342.4353716833.
Adding to 40154651 its reverse (15645104), we get a palindrome (55799755).
The spelling of 40154651 in words is "forty million, one hundred fifty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.268 sec. • engine limits •