Base | Representation |
---|---|
bin | 10010011010110011001000… |
… | …10010100111000000010000 |
3 | 12022102001220100001010011110 |
4 | 21031121210102213000100 |
5 | 20302101100343414412 |
6 | 222050531353213320 |
7 | 11350155440140602 |
oct | 1115314422470020 |
9 | 168361810033143 |
10 | 40503224201232 |
11 | 119a6359165691 |
12 | 4661967a01240 |
13 | 197a58c6a8800 |
14 | a0051b9c7172 |
15 | 4a38ad92dd3c |
hex | 24d6644a7010 |
40503224201232 has 60 divisors (see below), whose sum is σ = 113301178964304. Its totient is φ = 12462530520960.
The previous prime is 40503224201201. The next prime is 40503224201339. The reversal of 40503224201232 is 23210242230504.
It is a super-2 number, since 2×405032242012322 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 40503224201232.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2496492394 + ... + 2496508617.
Almost surely, 240503224201232 is an apocalyptic number.
It is an amenable number.
40503224201232 is an abundant number, since it is smaller than the sum of its proper divisors (72797954763072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40503224201232 is a wasteful number, since it uses less digits than its factorization.
40503224201232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4993001048 (or 4993001029 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 30.
Adding to 40503224201232 its reverse (23210242230504), we get a palindrome (63713466431736).
The spelling of 40503224201232 in words is "forty trillion, five hundred three billion, two hundred twenty-four million, two hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •