Base | Representation |
---|---|
bin | 10010011011101001011110… |
… | …10100011010010011011101 |
3 | 12022111212012122221001211222 |
4 | 21031310233110122103131 |
5 | 20303040323431032000 |
6 | 222112154433223125 |
7 | 11352240443365505 |
oct | 1115645724322335 |
9 | 168455178831758 |
10 | 40532400252125 |
11 | 11a077702a0541 |
12 | 466754aa01aa5 |
13 | 198025c153c52 |
14 | a01ac8830a05 |
15 | 4a451a04ea85 |
hex | 24dd2f51a4dd |
40532400252125 has 8 divisors (see below), whose sum is σ = 50584435514808. Its totient is φ = 32425920201600.
The previous prime is 40532400252089. The next prime is 40532400252151. The reversal of 40532400252125 is 52125200423504.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 7650960685369 + 32881439566756 = 2766037^2 + 5734234^2 .
It is not a de Polignac number, because 40532400252125 - 238 = 40257522345181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 162129600884 + ... + 162129601133.
It is an arithmetic number, because the mean of its divisors is an integer number (6323054439351).
Almost surely, 240532400252125 is an apocalyptic number.
It is an amenable number.
40532400252125 is a deficient number, since it is larger than the sum of its proper divisors (10052035262683).
40532400252125 is an equidigital number, since it uses as much as digits as its factorization.
40532400252125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324259202032 (or 324259202022 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 35.
Adding to 40532400252125 its reverse (52125200423504), we get a palindrome (92657600675629).
The spelling of 40532400252125 in words is "forty trillion, five hundred thirty-two billion, four hundred million, two hundred fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •