Base | Representation |
---|---|
bin | 111011001010110100011… |
… | …0111101111110010001001 |
3 | 1001210102110022001200010221 |
4 | 1312111220313233302021 |
5 | 2031214101412113213 |
6 | 25143503342510041 |
7 | 1466345553016114 |
oct | 166255067576211 |
9 | 31712408050127 |
10 | 8132132535433 |
11 | 26558aa8a2845 |
12 | ab408a895321 |
13 | 46cb1a53887a |
14 | 20185106357b |
15 | e180711b38d |
hex | 76568defc89 |
8132132535433 has 2 divisors, whose sum is σ = 8132132535434. Its totient is φ = 8132132535432.
The previous prime is 8132132535389. The next prime is 8132132535523. The reversal of 8132132535433 is 3345352312318.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7964795906809 + 167336628624 = 2822197^2 + 409068^2 .
It is a cyclic number.
It is not a de Polignac number, because 8132132535433 - 29 = 8132132534921 is a prime.
It is a super-2 number, since 2×81321325354332 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 8132132535433.
It is not a weakly prime, because it can be changed into another prime (8132132535133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4066066267716 + 4066066267717.
It is an arithmetic number, because the mean of its divisors is an integer number (4066066267717).
Almost surely, 28132132535433 is an apocalyptic number.
It is an amenable number.
8132132535433 is a deficient number, since it is larger than the sum of its proper divisors (1).
8132132535433 is an equidigital number, since it uses as much as digits as its factorization.
8132132535433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 777600, while the sum is 43.
The spelling of 8132132535433 in words is "eight trillion, one hundred thirty-two billion, one hundred thirty-two million, five hundred thirty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •