Base | Representation |
---|---|
bin | 10101101010101110… |
… | …00101001011010001 |
3 | 1010000200220102020202 |
4 | 22311113011023101 |
5 | 142310430124301 |
6 | 5202144144545 |
7 | 561160663100 |
oct | 126527051321 |
9 | 33020812222 |
10 | 11632661201 |
11 | 4a2a374597 |
12 | 2307908155 |
13 | 113501a5a5 |
14 | 7c4d1a037 |
15 | 4813ae66b |
hex | 2b55c52d1 |
11632661201 has 6 divisors (see below), whose sum is σ = 13531871250. Its totient is φ = 9970852416.
The previous prime is 11632661083. The next prime is 11632661207. The reversal of 11632661201 is 10216623611.
It is a happy number.
11632661201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 11631406801 + 1254400 = 107849^2 + 1120^2 .
It is not a de Polignac number, because 11632661201 - 222 = 11628466897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11632661207) 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 5 ways as a sum of consecutive naturals, for example, 118700576 + ... + 118700673.
It is an arithmetic number, because the mean of its divisors is an integer number (2255311875).
Almost surely, 211632661201 is an apocalyptic number.
It is an amenable number.
11632661201 is a deficient number, since it is larger than the sum of its proper divisors (1899210049).
11632661201 is an equidigital number, since it uses as much as digits as its factorization.
11632661201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237401263 (or 237401256 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 11632661201 in words is "eleven billion, six hundred thirty-two million, six hundred sixty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •