Base | Representation |
---|---|
bin | 10010010011100100001001… |
… | …10001101011000101100001 |
3 | 12021112022022112201220021111 |
4 | 21021302010301223011201 |
5 | 20234013021221042121 |
6 | 221340422551423321 |
7 | 11323206012554536 |
oct | 1111620461530541 |
9 | 167468275656244 |
10 | 40254661112161 |
11 | 1190a9a6840931 |
12 | 4621758684b41 |
13 | 195ccc921cb92 |
14 | 9d249bd74d8d |
15 | 49c1b1d4b2e1 |
hex | 249c84c6b161 |
40254661112161 has 8 divisors (see below), whose sum is σ = 41569076831744. Its totient is φ = 38941237784160.
The previous prime is 40254661112153. The next prime is 40254661112179. The reversal of 40254661112161 is 16121116645204.
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 40254661112161 - 23 = 40254661112153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40254661112131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248015445 + ... + 248177698.
It is an arithmetic number, because the mean of its divisors is an integer number (5196134603968).
Almost surely, 240254661112161 is an apocalyptic number.
It is an amenable number.
40254661112161 is a deficient number, since it is larger than the sum of its proper divisors (1314415719583).
40254661112161 is a wasteful number, since it uses less digits than its factorization.
40254661112161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496195791.
The product of its (nonzero) digits is 69120, while the sum is 40.
Adding to 40254661112161 its reverse (16121116645204), we get a palindrome (56375777757365).
The spelling of 40254661112161 in words is "forty trillion, two hundred fifty-four billion, six hundred sixty-one million, one hundred twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •