Base | Representation |
---|---|
bin | 10010001111011111000110… |
… | …10000100011100111010101 |
3 | 12021000220120100002220010002 |
4 | 21013233203100203213111 |
5 | 20224214010130024212 |
6 | 221152204053141045 |
7 | 11310115003653416 |
oct | 1107574320434725 |
9 | 167026510086102 |
10 | 40114512345557 |
11 | 11866518488191 |
12 | 45ba56502a785 |
13 | 194ca228a1510 |
14 | 9c97a4a9d80d |
15 | 49870d040ac2 |
hex | 247be34239d5 |
40114512345557 has 8 divisors (see below), whose sum is σ = 43347685174584. Its totient is φ = 36902402532288.
The previous prime is 40114512345547. The next prime is 40114512345559. The reversal of 40114512345557 is 75554321541104.
It can be written as a sum of positive squares in 4 ways, for example, as 22830421178161 + 17284091167396 = 4778119^2 + 4157414^2 .
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 40114512345557 - 212 = 40114512341461 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40114512345559) 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, 5265749978 + ... + 5265757595.
It is an arithmetic number, because the mean of its divisors is an integer number (5418460646823).
Almost surely, 240114512345557 is an apocalyptic number.
It is an amenable number.
40114512345557 is a deficient number, since it is larger than the sum of its proper divisors (3233172829027).
40114512345557 is a wasteful number, since it uses less digits than its factorization.
40114512345557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10531507879.
The product of its (nonzero) digits is 1680000, while the sum is 47.
The spelling of 40114512345557 in words is "forty trillion, one hundred fourteen billion, five hundred twelve million, three hundred forty-five thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •