Base | Representation |
---|---|
bin | 10010001111111111110010… |
… | …11111001111001110100001 |
3 | 12021002120212121211100211011 |
4 | 21013333321133033032201 |
5 | 20230010432140142040 |
6 | 221204225523020521 |
7 | 11311305662306665 |
oct | 1107777137171641 |
9 | 167076777740734 |
10 | 40132065162145 |
11 | 11872a055a8080 |
12 | 4601a4350a741 |
13 | 195158c280118 |
14 | 9ca58bd628a5 |
15 | 498dd90153ea |
hex | 247ff97cf3a1 |
40132065162145 has 8 divisors (see below), whose sum is σ = 52536521666880. Its totient is φ = 29186956481520.
The previous prime is 40132065162127. The next prime is 40132065162151. The reversal of 40132065162145 is 54126156023104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40132065162145 - 27 = 40132065162017 is a prime.
It is a super-2 number, since 2×401320651621452 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40132065162098 and 40132065162107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 364836955965 + ... + 364836956074.
It is an arithmetic number, because the mean of its divisors is an integer number (6567065208360).
Almost surely, 240132065162145 is an apocalyptic number.
It is an amenable number.
40132065162145 is a deficient number, since it is larger than the sum of its proper divisors (12404456504735).
40132065162145 is a wasteful number, since it uses less digits than its factorization.
40132065162145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729673912055.
The product of its (nonzero) digits is 172800, while the sum is 40.
The spelling of 40132065162145 in words is "forty trillion, one hundred thirty-two billion, sixty-five million, one hundred sixty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •