Base | Representation |
---|---|
bin | 10010010000000100001101… |
… | …01011110011011000101010 |
3 | 12021002210222201022000001012 |
4 | 21020002012223303120222 |
5 | 20230030310103342214 |
6 | 221205300544223522 |
7 | 11311421455415303 |
oct | 1110020653633052 |
9 | 167083881260035 |
10 | 40134434043434 |
11 | 11873a10795705 |
12 | 46023a490aba2 |
13 | 1951878c91823 |
14 | 9ca7348017aa |
15 | 498ec6e9103e |
hex | 248086af362a |
40134434043434 has 8 divisors (see below), whose sum is σ = 60201717347748. Its totient is φ = 20067194927520.
The previous prime is 40134434043317. The next prime is 40134434043461. The reversal of 40134434043434 is 43434043443104.
It can be written as a sum of positive squares in 2 ways, for example, as 35858575169209 + 4275858874225 = 5988203^2 + 2067815^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×401344340434342 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40134434043391 and 40134434043400.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 8674547 + ... + 12470630.
Almost surely, 240134434043434 is an apocalyptic number.
40134434043434 is a deficient number, since it is larger than the sum of its proper divisors (20067283304314).
40134434043434 is a wasteful number, since it uses less digits than its factorization.
40134434043434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22094200.
The product of its (nonzero) digits is 1327104, while the sum is 41.
Adding to 40134434043434 its reverse (43434043443104), we get a palindrome (83568477486538).
The spelling of 40134434043434 in words is "forty trillion, one hundred thirty-four billion, four hundred thirty-four million, forty-three thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •