Base | Representation |
---|---|
bin | 10011100111011000001010… |
… | …00011100100101110010111 |
3 | 12122201121112101100211210101 |
4 | 21303230011003210232113 |
5 | 21123203313443023123 |
6 | 231423404441034531 |
7 | 12041234445124150 |
oct | 1163540503445627 |
9 | 178647471324711 |
10 | 43134441376663 |
11 | 1282023970a9aa |
12 | 4a078b1185a47 |
13 | 1b0b73918b500 |
14 | a91a0a686927 |
15 | 4ec05c182aad |
hex | 273b050e4b97 |
43134441376663 has 48 divisors (see below), whose sum is σ = 53592694848000. Its totient is φ = 33992562943872.
The previous prime is 43134441376639. The next prime is 43134441376679. The reversal of 43134441376663 is 36667314443134.
43134441376663 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-43134441376663 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43134441376063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2738860713 + ... + 2738876461.
It is an arithmetic number, because the mean of its divisors is an integer number (1116514476000).
Almost surely, 243134441376663 is an apocalyptic number.
43134441376663 is a deficient number, since it is larger than the sum of its proper divisors (10458253471337).
43134441376663 is a wasteful number, since it uses less digits than its factorization.
43134441376663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24848 (or 24835 counting only the distinct ones).
The product of its digits is 31352832, while the sum is 55.
The spelling of 43134441376663 in words is "forty-three trillion, one hundred thirty-four billion, four hundred forty-one million, three hundred seventy-six thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •