Base | Representation |
---|---|
bin | 100101101110010010… |
… | …011011101010001001 |
3 | 10212112212100210012122 |
4 | 211232102123222021 |
5 | 1130423242000210 |
6 | 30335135221025 |
7 | 2632516041164 |
oct | 455622335211 |
9 | 125485323178 |
10 | 40505031305 |
11 | 161a6041592 |
12 | 7a25077775 |
13 | 3a868a975b |
14 | 1d636b2adb |
15 | 10c0ee5b55 |
hex | 96e49ba89 |
40505031305 has 4 divisors (see below), whose sum is σ = 48606037572. Its totient is φ = 32404025040.
The previous prime is 40505031271. The next prime is 40505031311. The reversal of 40505031305 is 50313050504.
40505031305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 25865967241 + 14639064064 = 160829^2 + 120992^2 .
It is not a de Polignac number, because 40505031305 - 212 = 40505027209 is a prime.
It is a super-2 number, since 2×405050313052 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4050503126 + ... + 4050503135.
It is an arithmetic number, because the mean of its divisors is an integer number (12151509393).
Almost surely, 240505031305 is an apocalyptic number.
It is an amenable number.
40505031305 is a deficient number, since it is larger than the sum of its proper divisors (8101006267).
40505031305 is an equidigital number, since it uses as much as digits as its factorization.
40505031305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8101006266.
The product of its (nonzero) digits is 4500, while the sum is 26.
Adding to 40505031305 its reverse (50313050504), we get a palindrome (90818081809).
The spelling of 40505031305 in words is "forty billion, five hundred five million, thirty-one thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •