Base | Representation |
---|---|
bin | 1001101010000… |
… | …0101100111010 |
3 | 2211012211012200 |
4 | 2122200230322 |
5 | 40332112442 |
6 | 4004051030 |
7 | 1001164551 |
oct | 232405472 |
9 | 84184180 |
10 | 40504122 |
11 | 2095538a |
12 | 11693a76 |
13 | 8512149 |
14 | 5544d98 |
15 | 385134c |
hex | 26a0b3a |
40504122 has 48 divisors (see below), whose sum is σ = 91700232. Its totient is φ = 12908160.
The previous prime is 40504099. The next prime is 40504133. The reversal of 40504122 is 22140504.
40504122 is a `hidden beast` number, since 40 + 504 + 122 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 37711881 + 2792241 = 6141^2 + 1671^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 40504095 and 40504104.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40128 + ... + 41124.
Almost surely, 240504122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40504122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45850116).
40504122 is an abundant number, since it is smaller than the sum of its proper divisors (51196110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40504122 is a wasteful number, since it uses less digits than its factorization.
40504122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1103 (or 1100 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 18.
The square root of 40504122 is about 6364.2848773448. The cubic root of 40504122 is about 343.4259230179.
Adding to 40504122 its reverse (22140504), we get a palindrome (62644626).
The spelling of 40504122 in words is "forty million, five hundred four thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •