Base | Representation |
---|---|
bin | 1001111000100… |
… | …0001011000110 |
3 | 2212222222202210 |
4 | 2132020023012 |
5 | 41102432410 |
6 | 4040244250 |
7 | 1012223661 |
oct | 236101306 |
9 | 85888683 |
10 | 41452230 |
11 | 21442746 |
12 | 11a70686 |
13 | 8784861 |
14 | 57106d8 |
15 | 398c220 |
hex | 27882c6 |
41452230 has 64 divisors (see below), whose sum is σ = 103638528. Its totient is φ = 10602240.
The previous prime is 41452217. The next prime is 41452231. The reversal of 41452230 is 3225414.
It is a junction number, because it is equal to n+sod(n) for n = 41452197 and 41452206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41452231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82159 + ... + 82661.
It is an arithmetic number, because the mean of its divisors is an integer number (1619352).
Almost surely, 241452230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41452230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51819264).
41452230 is an abundant number, since it is smaller than the sum of its proper divisors (62186298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41452230 is a wasteful number, since it uses less digits than its factorization.
41452230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621.
The product of its (nonzero) digits is 960, while the sum is 21.
The square root of 41452230 is about 6438.3406247262. The cubic root of 41452230 is about 346.0848856739.
Adding to 41452230 its reverse (3225414), we get a palindrome (44677644).
The spelling of 41452230 in words is "forty-one million, four hundred fifty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •