Base | Representation |
---|---|
bin | 10010010101110010110001… |
… | …01110100101011100010001 |
3 | 12021210121221212110110101110 |
4 | 21022321120232211130101 |
5 | 20241241330232011213 |
6 | 221435524553123533 |
7 | 11331556341346014 |
oct | 1112713056453421 |
9 | 167717855413343 |
10 | 40331231516433 |
11 | 1193a419837980 |
12 | 46345679b95a9 |
13 | 19672ac968bc0 |
14 | 9d608343b37b |
15 | 49e1941b85c3 |
hex | 24ae58ba5711 |
40331231516433 has 32 divisors (see below), whose sum is σ = 63338601755520. Its totient is φ = 22504924247040.
The previous prime is 40331231516413. The next prime is 40331231516461. The reversal of 40331231516433 is 33461513213304.
It is not a de Polignac number, because 40331231516433 - 26 = 40331231516369 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 40331231516391 and 40331231516400.
It is not an unprimeable number, because it can be changed into a prime (40331231516413) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 120671416 + ... + 121005177.
It is an arithmetic number, because the mean of its divisors is an integer number (1979331304860).
Almost surely, 240331231516433 is an apocalyptic number.
It is an amenable number.
40331231516433 is a deficient number, since it is larger than the sum of its proper divisors (23007370239087).
40331231516433 is a wasteful number, since it uses less digits than its factorization.
40331231516433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 241677009.
The product of its (nonzero) digits is 233280, while the sum is 39.
Adding to 40331231516433 its reverse (33461513213304), we get a palindrome (73792744729737).
The spelling of 40331231516433 in words is "forty trillion, three hundred thirty-one billion, two hundred thirty-one million, five hundred sixteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •