Base | Representation |
---|---|
bin | 11110000000110111100011… |
… | …010010101000011001001011 |
3 | 122022101011202122212012121021 |
4 | 132000313203102220121023 |
5 | 114300201114031020133 |
6 | 1144424235254453311 |
7 | 36542521622346424 |
oct | 3600674322503113 |
9 | 568334678765537 |
10 | 132001043220043 |
11 | 39072367701738 |
12 | 1297a82a364237 |
13 | 588684cca9b0a |
14 | 2484c5540a64b |
15 | 103d9b3e4352d |
hex | 780de34a864b |
132001043220043 has 8 divisors (see below), whose sum is σ = 134812054555200. Its totient is φ = 129190135155840.
The previous prime is 132001043220037. The next prime is 132001043220061. The reversal of 132001043220043 is 340022340100231.
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 132001043220043 - 221 = 132001041122891 is a prime.
It is a super-2 number, since 2×1320010432200432 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132001043220643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23231388 + ... + 28349593.
It is an arithmetic number, because the mean of its divisors is an integer number (16851506819400).
Almost surely, 2132001043220043 is an apocalyptic number.
132001043220043 is a deficient number, since it is larger than the sum of its proper divisors (2811011335157).
132001043220043 is an equidigital number, since it uses as much as digits as its factorization.
132001043220043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51635477.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 132001043220043 its reverse (340022340100231), we get a palindrome (472023383320274).
The spelling of 132001043220043 in words is "one hundred thirty-two trillion, one billion, forty-three million, two hundred twenty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •