Base | Representation |
---|---|

bin | 1001101010001… |

… | …0111001100010 |

3 | 2211020021120000 |

4 | 2122202321202 |

5 | 40332404442 |

6 | 4004200430 |

7 | 1001233026 |

oct | 232427142 |

9 | 84207500 |

10 | 40513122 |

11 | 20961121 |

12 | 11699116 |

13 | 8516280 |

14 | 5548386 |

15 | 3853d4c |

hex | 26a2e62 |

40513122 has 40 divisors (see below), whose sum is σ = 97767516. Its totient is φ = 12464928.

The previous prime is 40513061. The next prime is 40513133. The reversal of 40513122 is 22131504.

It can be written as a sum of positive squares in 2 ways, for example, as 34117281 + 6395841 = 5841^2 + 2529^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* = 40513095 and 40513104.

It is an unprimeable number.

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 7513 + ... + 11724.

Almost surely, 2^{40513122} is an apocalyptic number.

40513122 is an abundant number, since it is smaller than the sum of its proper divisors (57254394).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

40513122 is a wasteful number, since it uses less digits than its factorization.

40513122 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 19264 (or 19255 counting only the distinct ones).

The product of its (nonzero) digits is 240, while the sum is 18.

The square root of 40513122 is about 6364.9919088715. The cubic root of 40513122 is about 343.4513575026.

Adding to 40513122 its reverse (22131504), we get a palindrome (62644626).

The spelling of 40513122 in words is "forty million, five hundred thirteen thousand, one hundred twenty-two".

Divisors: 1 2 3 6 9 13 18 26 27 39 54 78 81 117 162 234 351 702 1053 2106 19237 38474 57711 115422 173133 250081 346266 500162 519399 750243 1038798 1500486 1558197 2250729 3116394 4501458 6752187 13504374 20256561 40513122

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •