Base | Representation |
---|---|
bin | 100000111100011… |
… | …0011100100010001 |
3 | 2212001000122220000 |
4 | 1001320303210101 |
5 | 4230441112241 |
6 | 301404440213 |
7 | 36251555421 |
oct | 10170634421 |
9 | 2761018800 |
10 | 1105410321 |
11 | 517a80154 |
12 | 26a249069 |
13 | 148026462 |
14 | a6b4a481 |
15 | 670a3eb6 |
hex | 41e33911 |
1105410321 has 10 divisors (see below), whose sum is σ = 1651292082. Its totient is φ = 736940160.
The previous prime is 1105410247. The next prime is 1105410359. The reversal of 1105410321 is 1230145011.
It can be written as a sum of positive squares in only one way, i.e., 1003622400 + 101787921 = 31680^2 + 10089^2 .
It is not a de Polignac number, because 1105410321 - 214 = 1105393937 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1105410294 and 1105410303.
It is not an unprimeable number, because it can be changed into a prime (1105410721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6823440 + ... + 6823601.
Almost surely, 21105410321 is an apocalyptic number.
It is an amenable number.
1105410321 is a deficient number, since it is larger than the sum of its proper divisors (545881761).
1105410321 is an equidigital number, since it uses as much as digits as its factorization.
1105410321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13647053 (or 13647044 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 1105410321 is about 33247.7115152306. The cubic root of 1105410321 is about 1033.9697624930.
Adding to 1105410321 its reverse (1230145011), we get a palindrome (2335555332).
The spelling of 1105410321 in words is "one billion, one hundred five million, four hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •