Base | Representation |
---|---|
bin | 10010011011000000100100… |
… | …00011100010111010100001 |
3 | 12022102202111211101222011202 |
4 | 21031200102003202322201 |
5 | 20302210332210031301 |
6 | 222054123042050545 |
7 | 11350532221242314 |
oct | 1115402203427241 |
9 | 168382454358152 |
10 | 40510434455201 |
11 | 119a9419166167 |
12 | 466323a649a55 |
13 | 197b16b419089 |
14 | a00a0343497b |
15 | 4a3b8192a66b |
hex | 24d8120e2ea1 |
40510434455201 has 4 divisors (see below), whose sum is σ = 41197051988400. Its totient is φ = 39823816922004.
The previous prime is 40510434455191. The next prime is 40510434455207. The reversal of 40510434455201 is 10255443401504.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40510434455201 - 210 = 40510434454177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40510434455207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 343308766511 + ... + 343308766628.
It is an arithmetic number, because the mean of its divisors is an integer number (10299262997100).
Almost surely, 240510434455201 is an apocalyptic number.
It is an amenable number.
40510434455201 is a deficient number, since it is larger than the sum of its proper divisors (686617533199).
40510434455201 is an equidigital number, since it uses as much as digits as its factorization.
40510434455201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 686617533198.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 40510434455201 its reverse (10255443401504), we get a palindrome (50765877856705).
The spelling of 40510434455201 in words is "forty trillion, five hundred ten billion, four hundred thirty-four million, four hundred fifty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •