Base | Representation |
---|---|
bin | 1111110001011… |
… | …00100111001111 |
3 | 100012221201000122 |
4 | 13320230213033 |
5 | 232332201221 |
6 | 21043415155 |
7 | 3164362640 |
oct | 770544717 |
9 | 305851018 |
10 | 132303311 |
11 | 68755488 |
12 | 383844bb |
13 | 21543caa |
14 | 137dd6c7 |
15 | b935eab |
hex | 7e2c9cf |
132303311 has 16 divisors (see below), whose sum is σ = 154310400. Its totient is φ = 111087168.
The previous prime is 132303293. The next prime is 132303313. The reversal of 132303311 is 113303231.
It is a cyclic number.
It is not a de Polignac number, because 132303311 - 226 = 65194447 is a prime.
It is a super-2 number, since 2×1323033112 = 35008332203125442, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132303311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132303313) 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 15 ways as a sum of consecutive naturals, for example, 232235 + ... + 232803.
It is an arithmetic number, because the mean of its divisors is an integer number (9644400).
Almost surely, 2132303311 is an apocalyptic number.
132303311 is a deficient number, since it is larger than the sum of its proper divisors (22007089).
132303311 is an equidigital number, since it uses as much as digits as its factorization.
132303311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1198.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 132303311 is about 11502.3176360245. The cubic root of 132303311 is about 509.5540263786.
Adding to 132303311 its reverse (113303231), we get a palindrome (245606542).
The spelling of 132303311 in words is "one hundred thirty-two million, three hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •