Base | Representation |
---|---|
bin | 1001100100000… |
… | …0101011001110 |
3 | 2210110211200010 |
4 | 2121000223032 |
5 | 40232021143 |
6 | 3551414050 |
7 | 664636050 |
oct | 231005316 |
9 | 83424603 |
10 | 40110798 |
11 | 20706922 |
12 | 11524326 |
13 | 8405100 |
14 | 54818d0 |
15 | 37c4a33 |
hex | 2640ace |
40110798 has 48 divisors (see below), whose sum is σ = 99294336. Its totient is φ = 10576800.
The previous prime is 40110797. The next prime is 40110809. The reversal of 40110798 is 89701104.
It is a super-2 number, since 2×401107982 = 3217752232393608, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40110793) 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 23 ways as a sum of consecutive naturals, for example, 4273 + ... + 9923.
It is an arithmetic number, because the mean of its divisors is an integer number (2068632).
Almost surely, 240110798 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40110798, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49647168).
40110798 is an abundant number, since it is smaller than the sum of its proper divisors (59183538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40110798 is a wasteful number, since it uses less digits than its factorization.
40110798 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5689 (or 5676 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 30.
The square root of 40110798 is about 6333.3086139868. The cubic root of 40110798 is about 342.3106680858.
The spelling of 40110798 in words is "forty million, one hundred ten thousand, seven hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •