Base | Representation |
---|---|
bin | 1001110001110… |
… | …1010011000110 |
3 | 2212011202021110 |
4 | 2130131103012 |
5 | 40444430340 |
6 | 4023025450 |
7 | 1005421500 |
oct | 234352306 |
9 | 85152243 |
10 | 41014470 |
11 | 21173862 |
12 | 1189b286 |
13 | 8660523 |
14 | 5638d70 |
15 | 3902680 |
hex | 271d4c6 |
41014470 has 48 divisors (see below), whose sum is σ = 114509808. Its totient is φ = 9374400.
The previous prime is 41014459. The next prime is 41014481. The reversal of 41014470 is 7441014.
41014470 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (41014459) and next prime (41014481).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 12481 + ... + 15420.
It is an arithmetic number, because the mean of its divisors is an integer number (2385621).
Almost surely, 241014470 is an apocalyptic number.
41014470 is an abundant number, since it is smaller than the sum of its proper divisors (73495338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41014470 is a wasteful number, since it uses less digits than its factorization.
41014470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27925 (or 27918 counting only the distinct ones).
The product of its (nonzero) digits is 448, while the sum is 21.
The square root of 41014470 is about 6404.2540549232. The cubic root of 41014470 is about 344.8622848796.
Adding to 41014470 its reverse (7441014), we get a palindrome (48455484).
The spelling of 41014470 in words is "forty-one million, fourteen thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •