Base | Representation |
---|---|
bin | 111101101100111101… |
… | …1000011001011010111 |
3 | 110200000111211021020001 |
4 | 1323121323003023113 |
5 | 4132332304414023 |
6 | 140512205152131 |
7 | 12400413141046 |
oct | 1733173031327 |
9 | 420014737201 |
10 | 132505154263 |
11 | 51216783659 |
12 | 2181b85b647 |
13 | c658bba031 |
14 | 65b009c55d |
15 | 36a7c5b6ad |
hex | 1ed9ec32d7 |
132505154263 has 8 divisors (see below), whose sum is σ = 140747822208. Its totient is φ = 124312291584.
The previous prime is 132505154251. The next prime is 132505154269. The reversal of 132505154263 is 362451505231.
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 132505154263 - 229 = 131968283351 is a prime.
It is a super-2 number, since 2×1325051542632 (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 (132505154269) 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, 12445831 + ... + 12456472.
It is an arithmetic number, because the mean of its divisors is an integer number (17593477776).
Almost surely, 2132505154263 is an apocalyptic number.
132505154263 is a deficient number, since it is larger than the sum of its proper divisors (8242667945).
132505154263 is a wasteful number, since it uses less digits than its factorization.
132505154263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24902633.
The product of its (nonzero) digits is 108000, while the sum is 37.
Adding to 132505154263 its reverse (362451505231), we get a palindrome (494956659494).
The spelling of 132505154263 in words is "one hundred thirty-two billion, five hundred five million, one hundred fifty-four thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •