Base | Representation |
---|---|
bin | 1001101000101… |
… | …1011001110001 |
3 | 2211001101112112 |
4 | 2122023121301 |
5 | 40321320011 |
6 | 4002135105 |
7 | 1000352321 |
oct | 232133161 |
9 | 84041475 |
10 | 40416881 |
11 | 208a588a |
12 | 11651495 |
13 | 84b151b |
14 | 5521281 |
15 | 383558b |
hex | 268b671 |
40416881 has 2 divisors, whose sum is σ = 40416882. Its totient is φ = 40416880.
The previous prime is 40416877. The next prime is 40416889. The reversal of 40416881 is 18861404.
40416881 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27920656 + 12496225 = 5284^2 + 3535^2 .
It is a cyclic number.
It is not a de Polignac number, because 40416881 - 22 = 40416877 is a prime.
It is a super-2 number, since 2×404168812 = 3267048539536322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (40416889) 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, 20208440 + 20208441.
It is an arithmetic number, because the mean of its divisors is an integer number (20208441).
Almost surely, 240416881 is an apocalyptic number.
It is an amenable number.
40416881 is a deficient number, since it is larger than the sum of its proper divisors (1).
40416881 is an equidigital number, since it uses as much as digits as its factorization.
40416881 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 32.
The square root of 40416881 is about 6357.4272311997. The cubic root of 40416881 is about 343.1791797573.
The spelling of 40416881 in words is "forty million, four hundred sixteen thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •