Base | Representation |
---|---|
bin | 100000110100011… |
… | …0111000011110001 |
3 | 2211202011022000012 |
4 | 1001220313003301 |
5 | 4223403332241 |
6 | 301135104305 |
7 | 36201206012 |
oct | 10150670361 |
9 | 2752138005 |
10 | 1101230321 |
11 | 515685704 |
12 | 268972095 |
13 | 1471c1999 |
14 | a637d009 |
15 | 66a2a6eb |
hex | 41a370f1 |
1101230321 has 2 divisors, whose sum is σ = 1101230322. Its totient is φ = 1101230320.
The previous prime is 1101230309. The next prime is 1101230323. The reversal of 1101230321 is 1230321011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1084714225 + 16516096 = 32935^2 + 4064^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101230321 - 226 = 1034121457 is a prime.
It is a Sophie Germain prime.
Together with 1101230323, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1101230296 and 1101230305.
It is not a weakly prime, because it can be changed into another prime (1101230323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550615160 + 550615161.
It is an arithmetic number, because the mean of its divisors is an integer number (550615161).
Almost surely, 21101230321 is an apocalyptic number.
It is an amenable number.
1101230321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101230321 is an equidigital number, since it uses as much as digits as its factorization.
1101230321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1101230321 is about 33184.7905070983. The cubic root of 1101230321 is about 1032.6648314253.
Adding to 1101230321 its reverse (1230321011), we get a palindrome (2331551332).
The spelling of 1101230321 in words is "one billion, one hundred one million, two hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •