Base | Representation |
---|---|
bin | 1001100011110101… |
… | …11011000111111101 |
3 | 111020200200212211111 |
4 | 10301322323013331 |
5 | 41002404404110 |
6 | 2205143122021 |
7 | 241121336200 |
oct | 46172730775 |
9 | 14220625744 |
10 | 5132497405 |
11 | 21a41852a2 |
12 | bb2a43311 |
13 | 63a440019 |
14 | 369911937 |
15 | 2008c9e8a |
hex | 131ebb1fd |
5132497405 has 12 divisors (see below), whose sum is σ = 7164547740. Its totient is φ = 3519426624.
The previous prime is 5132497367. The next prime is 5132497411. The reversal of 5132497405 is 5047942315.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 3426229156 + 1706268249 = 58534^2 + 41307^2 .
It is not a de Polignac number, because 5132497405 - 27 = 5132497277 is a prime.
It is a super-2 number, since 2×51324974052 = 52685059224663468050, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10474240 + ... + 10474729.
It is an arithmetic number, because the mean of its divisors is an integer number (597045645).
Almost surely, 25132497405 is an apocalyptic number.
It is an amenable number.
5132497405 is a deficient number, since it is larger than the sum of its proper divisors (2032050335).
5132497405 is a wasteful number, since it uses less digits than its factorization.
5132497405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20948988 (or 20948981 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 40.
The square root of 5132497405 is about 71641.4503273070. The cubic root of 5132497405 is about 1724.9489481496.
The spelling of 5132497405 in words is "five billion, one hundred thirty-two million, four hundred ninety-seven thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •