Base | Representation |
---|---|
bin | 10010010010011001000100… |
… | …10010110010110100010011 |
3 | 12021101110021111001210100112 |
4 | 21021030202102302310103 |
5 | 20232332444130111111 |
6 | 221310115205311535 |
7 | 11320251120154430 |
oct | 1111144222626423 |
9 | 167343244053315 |
10 | 40214354144531 |
11 | 118a48a258a536 |
12 | 4615989a055ab |
13 | 19592746a0288 |
14 | 9d0556adcb87 |
15 | 49b10342ae8b |
hex | 2493224b2d13 |
40214354144531 has 16 divisors (see below), whose sum is σ = 47962174600704. Its totient is φ = 32967554615424.
The previous prime is 40214354144513. The next prime is 40214354144533. The reversal of 40214354144531 is 13544145341204.
It is a cyclic number.
It is not a de Polignac number, because 40214354144531 - 26 = 40214354144467 is a prime.
It is a super-2 number, since 2×402143541445312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (40214354144533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10543526 + ... + 13841771.
It is an arithmetic number, because the mean of its divisors is an integer number (2997635912544).
Almost surely, 240214354144531 is an apocalyptic number.
40214354144531 is a deficient number, since it is larger than the sum of its proper divisors (7747820456173).
40214354144531 is a wasteful number, since it uses less digits than its factorization.
40214354144531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24395570.
The product of its (nonzero) digits is 460800, while the sum is 41.
Adding to 40214354144531 its reverse (13544145341204), we get a palindrome (53758499485735).
The spelling of 40214354144531 in words is "forty trillion, two hundred fourteen billion, three hundred fifty-four million, one hundred forty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •