Base | Representation |
---|---|
bin | 111101100101100011000… |
… | …001000001111101001101 |
3 | 112222121001120111010221002 |
4 | 331211203001001331031 |
5 | 1023320023211013401 |
6 | 13000125255350045 |
7 | 614523650311136 |
oct | 75454301017515 |
9 | 15877046433832 |
10 | 4232204001101 |
11 | 139195a90950a |
12 | 584290682325 |
13 | 249130cb255b |
14 | 108ba8468c8d |
15 | 751517b5a6b |
hex | 3d963041f4d |
4232204001101 has 2 divisors, whose sum is σ = 4232204001102. Its totient is φ = 4232204001100.
The previous prime is 4232204001097. The next prime is 4232204001107. The reversal of 4232204001101 is 1011004022324.
4232204001101 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., 2439684678601 + 1792519322500 = 1561949^2 + 1338850^2 .
It is a cyclic number.
It is not a de Polignac number, because 4232204001101 - 22 = 4232204001097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4232204001107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2116102000550 + 2116102000551.
It is an arithmetic number, because the mean of its divisors is an integer number (2116102000551).
Almost surely, 24232204001101 is an apocalyptic number.
It is an amenable number.
4232204001101 is a deficient number, since it is larger than the sum of its proper divisors (1).
4232204001101 is an equidigital number, since it uses as much as digits as its factorization.
4232204001101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 4232204001101 its reverse (1011004022324), we get a palindrome (5243208023425).
The spelling of 4232204001101 in words is "four trillion, two hundred thirty-two billion, two hundred four million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •