Base | Representation |
---|---|
bin | 111101101110110100… |
… | …0101000000000100101 |
3 | 110200011212000100221022 |
4 | 1323131220220000211 |
5 | 4132444230331003 |
6 | 140522312100525 |
7 | 12402100406333 |
oct | 1733550500045 |
9 | 420155010838 |
10 | 132567433253 |
11 | 512489507a2 |
12 | 21838694745 |
13 | c668a843c8 |
14 | 65b8470b53 |
15 | 36ad45e738 |
hex | 1edda28025 |
132567433253 has 32 divisors (see below), whose sum is σ = 143292240000. Its totient is φ = 122199218176.
The previous prime is 132567433247. The next prime is 132567433259. The reversal of 132567433253 is 352334765231.
It is an interprime number because it is at equal distance from previous prime (132567433247) and next prime (132567433259).
It is a cyclic number.
It is not a de Polignac number, because 132567433253 - 218 = 132567171109 is a prime.
It is a super-2 number, since 2×1325674332532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132567433259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88436498 + ... + 88437996.
It is an arithmetic number, because the mean of its divisors is an integer number (4477882500).
Almost surely, 2132567433253 is an apocalyptic number.
It is an amenable number.
132567433253 is a deficient number, since it is larger than the sum of its proper divisors (10724806747).
132567433253 is a wasteful number, since it uses less digits than its factorization.
132567433253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2101.
The product of its digits is 1360800, while the sum is 44.
The spelling of 132567433253 in words is "one hundred thirty-two billion, five hundred sixty-seven million, four hundred thirty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •