Base | Representation |
---|---|
bin | 1001101010001… |
… | …1001010111000 |
3 | 2211020100002010 |
4 | 2122203022320 |
5 | 40332423412 |
6 | 4004205520 |
7 | 1001236203 |
oct | 232431270 |
9 | 84210063 |
10 | 40514232 |
11 | 20961a40 |
12 | 116998a0 |
13 | 8516925 |
14 | 554893a |
15 | 385433c |
hex | 26a32b8 |
40514232 has 128 divisors (see below), whose sum is σ = 119750400. Its totient is φ = 11289600.
The previous prime is 40514203. The next prime is 40514261. The reversal of 40514232 is 23241504.
It is an interprime number because it is at equal distance from previous prime (40514203) and next prime (40514261).
It is a junction number, because it is equal to n+sod(n) for n = 40514199 and 40514208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 205558 + ... + 205754.
It is an arithmetic number, because the mean of its divisors is an integer number (935550).
Almost surely, 240514232 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 40514232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59875200).
40514232 is an abundant number, since it is smaller than the sum of its proper divisors (79236168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40514232 is a wasteful number, since it uses less digits than its factorization.
40514232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277 (or 273 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 21.
The square root of 40514232 is about 6365.0791039861. The cubic root of 40514232 is about 343.4544941614.
Adding to 40514232 its reverse (23241504), we get a palindrome (63755736).
The spelling of 40514232 in words is "forty million, five hundred fourteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •