Base | Representation |
---|---|
bin | 100000111010010… |
… | …1100001000100101 |
3 | 2211221222211202022 |
4 | 1001310230020211 |
5 | 4230202100201 |
6 | 301325352525 |
7 | 36236442533 |
oct | 10164541045 |
9 | 2757884668 |
10 | 1104331301 |
11 | 5174034a7 |
12 | 269a08745 |
13 | 147a39298 |
14 | a6949153 |
15 | 66e3e41b |
hex | 41d2c225 |
1104331301 has 4 divisors (see below), whose sum is σ = 1105826400. Its totient is φ = 1102836204.
The previous prime is 1104331297. The next prime is 1104331307. The reversal of 1104331301 is 1031334011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1104331301 - 22 = 1104331297 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1104331301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104331307) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 746441 + ... + 747918.
It is an arithmetic number, because the mean of its divisors is an integer number (276456600).
Almost surely, 21104331301 is an apocalyptic number.
It is an amenable number.
1104331301 is a deficient number, since it is larger than the sum of its proper divisors (1495099).
1104331301 is an equidigital number, since it uses as much as digits as its factorization.
1104331301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1495098.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1104331301 is about 33231.4805718915. The cubic root of 1104331301 is about 1033.6332246356.
Adding to 1104331301 its reverse (1031334011), we get a palindrome (2135665312).
The spelling of 1104331301 in words is "one billion, one hundred four million, three hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •