Base | Representation |
---|---|
bin | 10010010110010111111111… |
… | …01100000010110011101111 |
3 | 12021212112112101020022221111 |
4 | 21023023333230002303233 |
5 | 20242103240400431133 |
6 | 221453031403212451 |
7 | 11333164443131560 |
oct | 1113137754026357 |
9 | 167775471208844 |
10 | 40351212514543 |
11 | 11947942568557 |
12 | 4638403517127 |
13 | 196914541c7c8 |
14 | 9d701adb8167 |
15 | 49e96342e1cd |
hex | 24b2ffb02cef |
40351212514543 has 4 divisors (see below), whose sum is σ = 46115671445200. Its totient is φ = 34586753583888.
The previous prime is 40351212514519. The next prime is 40351212514573. The reversal of 40351212514543 is 34541521215304.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40351212514543 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40351212514496 and 40351212514505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40351212514573) 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, 2882229465318 + ... + 2882229465331.
It is an arithmetic number, because the mean of its divisors is an integer number (11528917861300).
Almost surely, 240351212514543 is an apocalyptic number.
40351212514543 is a deficient number, since it is larger than the sum of its proper divisors (5764458930657).
40351212514543 is an equidigital number, since it uses as much as digits as its factorization.
40351212514543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5764458930656.
The product of its (nonzero) digits is 288000, while the sum is 40.
Adding to 40351212514543 its reverse (34541521215304), we get a palindrome (74892733729847).
The spelling of 40351212514543 in words is "forty trillion, three hundred fifty-one billion, two hundred twelve million, five hundred fourteen thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •