Base | Representation |
---|---|
bin | 1001110100110… |
… | …1110010010001 |
3 | 2212112211201010 |
4 | 2131031302101 |
5 | 41022304243 |
6 | 4031201133 |
7 | 1010206506 |
oct | 235156221 |
9 | 85484633 |
10 | 41213073 |
11 | 21299aa0 |
12 | 119761a9 |
13 | 86cca45 |
14 | 568b4ad |
15 | 3941433 |
hex | 274dc91 |
41213073 has 8 divisors (see below), whose sum is σ = 59946336. Its totient is φ = 24977600.
The previous prime is 41213063. The next prime is 41213101. The reversal of 41213073 is 37031214.
41213073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41213073 - 25 = 41213041 is a prime.
It is a super-2 number, since 2×412130732 = 3397034772206658, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (41213063) 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 7 ways as a sum of consecutive naturals, for example, 624408 + ... + 624473.
It is an arithmetic number, because the mean of its divisors is an integer number (7493292).
Almost surely, 241213073 is an apocalyptic number.
It is an amenable number.
41213073 is a deficient number, since it is larger than the sum of its proper divisors (18733263).
41213073 is a wasteful number, since it uses less digits than its factorization.
41213073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1248895.
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 41213073 is about 6419.7408826214. The cubic root of 41213073 is about 345.4180272046.
Adding to 41213073 its reverse (37031214), we get a palindrome (78244287).
The spelling of 41213073 in words is "forty-one million, two hundred thirteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •