Base | Representation |
---|---|
bin | 1001111000100… |
… | …1010000111101 |
3 | 2220000012220101 |
4 | 2132021100331 |
5 | 41103103301 |
6 | 4040321101 |
7 | 1012243006 |
oct | 236112075 |
9 | 86005811 |
10 | 41456701 |
11 | 21446040 |
12 | 11a73191 |
13 | 87868c0 |
14 | 57121ad |
15 | 398d701 |
hex | 278943d |
41456701 has 16 divisors (see below), whose sum is σ = 48948480. Its totient is φ = 34614720.
The previous prime is 41456677. The next prime is 41456711. The reversal of 41456701 is 10765414.
41456701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 41456701 - 25 = 41456669 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41456701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41456711) 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 15 ways as a sum of consecutive naturals, for example, 33571 + ... + 34783.
It is an arithmetic number, because the mean of its divisors is an integer number (3059280).
Almost surely, 241456701 is an apocalyptic number.
It is an amenable number.
41456701 is a deficient number, since it is larger than the sum of its proper divisors (7491779).
41456701 is a wasteful number, since it uses less digits than its factorization.
41456701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1476.
The product of its (nonzero) digits is 3360, while the sum is 28.
The square root of 41456701 is about 6438.6878321596. The cubic root of 41456701 is about 346.0973280274.
The spelling of 41456701 in words is "forty-one million, four hundred fifty-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •