Base | Representation |
---|---|
bin | 1100110100000011100… |
… | …1110100011101011001 |
3 | 210001012101121222120122 |
4 | 3031000321310131121 |
5 | 12101312322343001 |
6 | 245043301403025 |
7 | 21622040043014 |
oct | 3150071643531 |
9 | 701171558518 |
10 | 220132231001 |
11 | 853a29a6341 |
12 | 367b5a09475 |
13 | 179b2213bb7 |
14 | a923b8837b |
15 | 5ad5b0eb1b |
hex | 3340e74759 |
220132231001 has 2 divisors, whose sum is σ = 220132231002. Its totient is φ = 220132231000.
The previous prime is 220132230991. The next prime is 220132231037. The reversal of 220132231001 is 100132231022.
220132231001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 166157325376 + 53974905625 = 407624^2 + 232325^2 .
It is a cyclic number.
It is not a de Polignac number, because 220132231001 - 234 = 202952361817 is a prime.
It is not a weakly prime, because it can be changed into another prime (220132231061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110066115500 + 110066115501.
It is an arithmetic number, because the mean of its divisors is an integer number (110066115501).
Almost surely, 2220132231001 is an apocalyptic number.
It is an amenable number.
220132231001 is a deficient number, since it is larger than the sum of its proper divisors (1).
220132231001 is an equidigital number, since it uses as much as digits as its factorization.
220132231001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 220132231001 its reverse (100132231022), we get a palindrome (320264462023).
The spelling of 220132231001 in words is "two hundred twenty billion, one hundred thirty-two million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •