Base | Representation |
---|---|
bin | 100101110101011001… |
… | …111000100101011001 |
3 | 10212212012000121222122 |
4 | 211311121320211121 |
5 | 1131144323102210 |
6 | 30355042231025 |
7 | 2635465626512 |
oct | 456531704531 |
9 | 125765017878 |
10 | 40624425305 |
11 | 1625747a012 |
12 | 7a59055475 |
13 | 3aa55508a9 |
14 | 1d754b1a09 |
15 | 10cb72bb55 |
hex | 975678959 |
40624425305 has 4 divisors (see below), whose sum is σ = 48749310372. Its totient is φ = 32499540240.
The previous prime is 40624425269. The next prime is 40624425307. The reversal of 40624425305 is 50352442604.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30049182409 + 10575242896 = 173347^2 + 102836^2 .
It is not a de Polignac number, because 40624425305 - 226 = 40557316441 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (40624425307) 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 3 ways as a sum of consecutive naturals, for example, 4062442526 + ... + 4062442535.
It is an arithmetic number, because the mean of its divisors is an integer number (12187327593).
Almost surely, 240624425305 is an apocalyptic number.
It is an amenable number.
40624425305 is a deficient number, since it is larger than the sum of its proper divisors (8124885067).
40624425305 is an equidigital number, since it uses as much as digits as its factorization.
40624425305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8124885066.
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 40624425305 its reverse (50352442604), we get a palindrome (90976867909).
The spelling of 40624425305 in words is "forty billion, six hundred twenty-four million, four hundred twenty-five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •