Base | Representation |
---|---|
bin | 100101011000000101… |
… | …000010001110101101 |
3 | 10211120220020012022101 |
4 | 211120011002032231 |
5 | 1124142344424100 |
6 | 30234145015101 |
7 | 2620342642321 |
oct | 453005021655 |
9 | 124526205271 |
10 | 40132420525 |
11 | 1602478359a |
12 | 7940324491 |
13 | 3a276379c2 |
14 | 1d29ddb981 |
15 | 109d44286a |
hex | 9581423ad |
40132420525 has 24 divisors (see below), whose sum is σ = 51009235200. Its totient is φ = 31303651200.
The previous prime is 40132420519. The next prime is 40132420543. The reversal of 40132420525 is 52502423104.
40132420525 is digitally balanced in base 11, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40132420525 - 231 = 37984936877 is a prime.
It is a super-2 number, since 2×401324205252 (a number of 22 digits) contains 22 as substring.
40132420525 is strictly pandigital in base 11.
It is a junction number, because it is equal to n+sod(n) for n = 40132420493 and 40132420502.
It is a congruent number.
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, 1791846 + ... + 1814104.
It is an arithmetic number, because the mean of its divisors is an integer number (2125384800).
Almost surely, 240132420525 is an apocalyptic number.
It is an amenable number.
40132420525 is a deficient number, since it is larger than the sum of its proper divisors (10876814675).
40132420525 is a wasteful number, since it uses less digits than its factorization.
40132420525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24069 (or 24064 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 28.
Adding to 40132420525 its reverse (52502423104), we get a palindrome (92634843629).
The spelling of 40132420525 in words is "forty billion, one hundred thirty-two million, four hundred twenty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •