Base | Representation |
---|---|
bin | 10010001101011110010111… |
… | …11011010100011000000011 |
3 | 12020210022011212201101111222 |
4 | 21012233023323110120003 |
5 | 20222100440231103121 |
6 | 221100334202225255 |
7 | 11302120243561334 |
oct | 1106571373243003 |
9 | 166708155641458 |
10 | 40045401425411 |
11 | 1183a183139a58 |
12 | 45a9097ab522b |
13 | 194635a6c8c25 |
14 | 9c62ca1a028b |
15 | 496a15a010ab |
hex | 246bcbed4603 |
40045401425411 has 2 divisors, whose sum is σ = 40045401425412. Its totient is φ = 40045401425410.
The previous prime is 40045401425353. The next prime is 40045401425489. The reversal of 40045401425411 is 11452410454004.
40045401425411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40045401425411 is a prime.
It is not a weakly prime, because it can be changed into another prime (40045401425011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20022700712705 + 20022700712706.
It is an arithmetic number, because the mean of its divisors is an integer number (20022700712706).
Almost surely, 240045401425411 is an apocalyptic number.
40045401425411 is a deficient number, since it is larger than the sum of its proper divisors (1).
40045401425411 is an equidigital number, since it uses as much as digits as its factorization.
40045401425411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51200, while the sum is 35.
Adding to 40045401425411 its reverse (11452410454004), we get a palindrome (51497811879415).
The spelling of 40045401425411 in words is "forty trillion, forty-five billion, four hundred one million, four hundred twenty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •