Base | Representation |
---|---|
bin | 11110000011000101100100… |
… | …011010101010000011111011 |
3 | 122022220202100222010000101220 |
4 | 132003011210122222003323 |
5 | 114310200414030042001 |
6 | 1145022254541243123 |
7 | 36556530520005051 |
oct | 3603054432520373 |
9 | 568822328100356 |
10 | 132153533440251 |
11 | 39120aa9434114 |
12 | 129a42a6b634a3 |
13 | 589804244314b |
14 | 248c39d7c41d1 |
15 | 104293b46ac36 |
hex | 7831646aa0fb |
132153533440251 has 8 divisors (see below), whose sum is σ = 176233145151504. Its totient is φ = 88088138677920.
The previous prime is 132153533440211. The next prime is 132153533440277. The reversal of 132153533440251 is 152044335351231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132153533440251 - 213 = 132153533432059 is a prime.
It is not an unprimeable number, because it can be changed into a prime (132153533440211) 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 7 ways as a sum of consecutive naturals, for example, 3554215540 + ... + 3554252721.
It is an arithmetic number, because the mean of its divisors is an integer number (22029143143938).
Almost surely, 2132153533440251 is an apocalyptic number.
132153533440251 is a deficient number, since it is larger than the sum of its proper divisors (44079611711253).
132153533440251 is an equidigital number, since it uses as much as digits as its factorization.
132153533440251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7108474461.
The product of its (nonzero) digits is 648000, while the sum is 42.
Adding to 132153533440251 its reverse (152044335351231), we get a palindrome (284197868791482).
The spelling of 132153533440251 in words is "one hundred thirty-two trillion, one hundred fifty-three billion, five hundred thirty-three million, four hundred forty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •