Base | Representation |
---|---|
bin | 10010001111011111001011… |
… | …01000000000110010000011 |
3 | 12021000220200002211000200111 |
4 | 21013233211220000302003 |
5 | 20224214100311030041 |
6 | 221152212032132151 |
7 | 11310115665304264 |
oct | 1107574550006203 |
9 | 167026602730614 |
10 | 40114552048771 |
11 | 11866538935862 |
12 | 45ba576397057 |
13 | 194ca2ab92c45 |
14 | 9c97aa07696b |
15 | 498711784981 |
hex | 247be5a00c83 |
40114552048771 has 4 divisors (see below), whose sum is σ = 40664066460472. Its totient is φ = 39565037637072.
The previous prime is 40114552048733. The next prime is 40114552048817. The reversal of 40114552048771 is 17784025541104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40114552048771 - 213 = 40114552040579 is a prime.
It is a super-2 number, since 2×401145520487712 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40114552048721) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 274757205741 + ... + 274757205886.
It is an arithmetic number, because the mean of its divisors is an integer number (10166016615118).
Almost surely, 240114552048771 is an apocalyptic number.
40114552048771 is a deficient number, since it is larger than the sum of its proper divisors (549514411701).
40114552048771 is an equidigital number, since it uses as much as digits as its factorization.
40114552048771 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 549514411700.
The product of its (nonzero) digits is 1254400, while the sum is 49.
Adding to 40114552048771 its reverse (17784025541104), we get a palindrome (57898577589875).
The spelling of 40114552048771 in words is "forty trillion, one hundred fourteen billion, five hundred fifty-two million, forty-eight thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •