Base | Representation |
---|---|
bin | 10011100111111010000000… |
… | …00111001000111000010001 |
3 | 12122210100102201122222120102 |
4 | 21303331000013020320101 |
5 | 21124003022140123423 |
6 | 231440011501222145 |
7 | 12042446645152526 |
oct | 1163750007107021 |
9 | 178710381588512 |
10 | 43152612036113 |
11 | 12827a13565328 |
12 | 4a0b322561955 |
13 | 1b103738722c8 |
14 | a92851a1914d |
15 | 4ec7724ebc28 |
hex | 273f401c8e11 |
43152612036113 has 4 divisors (see below), whose sum is σ = 43152677270640. Its totient is φ = 43152546801588.
The previous prime is 43152612036077. The next prime is 43152612036137. The reversal of 43152612036113 is 31163021625134.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 43152612036113 - 216 = 43152611970577 is a prime.
It is a super-2 number, since 2×431526120361132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (43152612636113) 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, 31614743 + ... + 32951436.
It is an arithmetic number, because the mean of its divisors is an integer number (10788169317660).
Almost surely, 243152612036113 is an apocalyptic number.
It is an amenable number.
43152612036113 is a deficient number, since it is larger than the sum of its proper divisors (65234527).
43152612036113 is an equidigital number, since it uses as much as digits as its factorization.
43152612036113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65234526.
The product of its (nonzero) digits is 77760, while the sum is 38.
The spelling of 43152612036113 in words is "forty-three trillion, one hundred fifty-two billion, six hundred twelve million, thirty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •