Base | Representation |
---|---|
bin | 100101110001010011… |
… | …100011000101011001 |
3 | 10212200101121202120022 |
4 | 211301103203011121 |
5 | 1131024221434023 |
6 | 30344144240225 |
7 | 2634002245502 |
oct | 456123430531 |
9 | 125611552508 |
10 | 40555655513 |
11 | 1622167927a |
12 | 7a3a010075 |
13 | 3a94222cc9 |
14 | 1d6a2cdba9 |
15 | 10c56957c8 |
hex | 9714e3159 |
40555655513 has 2 divisors, whose sum is σ = 40555655514. Its totient is φ = 40555655512.
The previous prime is 40555655501. The next prime is 40555655521. The reversal of 40555655513 is 31555655504.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34699120729 + 5856534784 = 186277^2 + 76528^2 .
It is a cyclic number.
It is not a de Polignac number, because 40555655513 - 224 = 40538878297 is a prime.
It is a super-2 number, since 2×405556555132 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (40555655573) by changing a digit.
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 as a sum of consecutive naturals, namely, 20277827756 + 20277827757.
It is an arithmetic number, because the mean of its divisors is an integer number (20277827757).
Almost surely, 240555655513 is an apocalyptic number.
It is an amenable number.
40555655513 is a deficient number, since it is larger than the sum of its proper divisors (1).
40555655513 is an equidigital number, since it uses as much as digits as its factorization.
40555655513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1125000, while the sum is 44.
Subtracting from 40555655513 its reverse (31555655504), we obtain a palindrome (9000000009).
The spelling of 40555655513 in words is "forty billion, five hundred fifty-five million, six hundred fifty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •