Base | Representation |
---|---|
bin | 1001110101101… |
… | …1011111101100 |
3 | 2212122200201221 |
4 | 2131123133230 |
5 | 41031103403 |
6 | 4032313124 |
7 | 1010532310 |
oct | 235333754 |
9 | 85580657 |
10 | 41269228 |
11 | 21328200 |
12 | 119a27a4 |
13 | 871c480 |
14 | 56a3b40 |
15 | 3952dbd |
hex | 275b7ec |
41269228 has 72 divisors (see below), whose sum is σ = 97807136. Its totient is φ = 14826240.
The previous prime is 41269223. The next prime is 41269229. The reversal of 41269228 is 82296214.
It is a hoax number, since the sum of its digits (34) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 41269193 and 41269202.
It is not an unprimeable number, because it can be changed into a prime (41269223) 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 in 23 ways as a sum of consecutive naturals, for example, 43576 + ... + 44512.
Almost surely, 241269228 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41269228, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48903568).
41269228 is an abundant number, since it is smaller than the sum of its proper divisors (56537908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41269228 is a wasteful number, since it uses less digits than its factorization.
41269228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 983 (or 970 counting only the distinct ones).
The product of its digits is 13824, while the sum is 34.
The square root of 41269228 is about 6424.1130127046. The cubic root of 41269228 is about 345.5748394713.
The spelling of 41269228 in words is "forty-one million, two hundred sixty-nine thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •