Base | Representation |
---|---|
bin | 100101110101100100… |
… | …111001110001000011 |
3 | 10212212101110101011101 |
4 | 211311210321301003 |
5 | 1131201043014411 |
6 | 30355224155231 |
7 | 2635532316544 |
oct | 456544716103 |
9 | 125771411141 |
10 | 40627313731 |
11 | 16259072144 |
12 | 7a5a008b17 |
13 | 3aa6022514 |
14 | 1d75a244cb |
15 | 10cbaec8c1 |
hex | 975939c43 |
40627313731 has 8 divisors (see below), whose sum is σ = 42030289728. Its totient is φ = 39243960000.
The previous prime is 40627313729. The next prime is 40627313803. The reversal of 40627313731 is 13731372604.
40627313731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40627313731 - 21 = 40627313729 is a prime.
It is a super-2 number, since 2×406273137312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40627313131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4901355 + ... + 4909636.
It is an arithmetic number, because the mean of its divisors is an integer number (5253786216).
Almost surely, 240627313731 is an apocalyptic number.
40627313731 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
40627313731 is a deficient number, since it is larger than the sum of its proper divisors (1402975997).
40627313731 is a wasteful number, since it uses less digits than its factorization.
40627313731 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9811133.
The product of its (nonzero) digits is 63504, while the sum is 37.
The spelling of 40627313731 in words is "forty billion, six hundred twenty-seven million, three hundred thirteen thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •