Base | Representation |
---|---|
bin | 110111110100… |
… | …1011111100101 |
3 | 2001001222001211 |
4 | 1233221133211 |
5 | 24443033231 |
6 | 2523151421 |
7 | 503526163 |
oct | 157513745 |
9 | 61058054 |
10 | 29267941 |
11 | 1558048a |
12 | 9975571 |
13 | 60a9a11 |
14 | 3c5c233 |
15 | 2881eb1 |
hex | 1be97e5 |
29267941 has 2 divisors, whose sum is σ = 29267942. Its totient is φ = 29267940.
The previous prime is 29267939. The next prime is 29267969. The reversal of 29267941 is 14976292.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24295041 + 4972900 = 4929^2 + 2230^2 .
It is a cyclic number.
It is not a de Polignac number, because 29267941 - 21 = 29267939 is a prime.
It is a super-2 number, since 2×292679412 = 1713224740758962, which contains 22 as substring.
Together with 29267939, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 29267894 and 29267903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (29267911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14633970 + 14633971.
It is an arithmetic number, because the mean of its divisors is an integer number (14633971).
Almost surely, 229267941 is an apocalyptic number.
It is an amenable number.
29267941 is a deficient number, since it is larger than the sum of its proper divisors (1).
29267941 is an equidigital number, since it uses as much as digits as its factorization.
29267941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 54432, while the sum is 40.
The square root of 29267941 is about 5409.9853049708. The cubic root of 29267941 is about 308.1749898115.
The spelling of 29267941 in words is "twenty-nine million, two hundred sixty-seven thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •