Base | Representation |
---|---|
bin | 100000111010001… |
… | …0001110010110101 |
3 | 2211221210100202110 |
4 | 1001310101302311 |
5 | 4230140122123 |
6 | 301323201233 |
7 | 36235513146 |
oct | 10164216265 |
9 | 2757710673 |
10 | 1104223413 |
11 | 51733a437 |
12 | 269976219 |
13 | 1479cc147 |
14 | a691bacd |
15 | 66e1c493 |
hex | 41d11cb5 |
1104223413 has 4 divisors (see below), whose sum is σ = 1472297888. Its totient is φ = 736148940.
The previous prime is 1104223411. The next prime is 1104223427. The reversal of 1104223413 is 3143224011.
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 not a de Polignac number, because 1104223413 - 21 = 1104223411 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 1104223413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104223411) 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, 184037233 + ... + 184037238.
It is an arithmetic number, because the mean of its divisors is an integer number (368074472).
Almost surely, 21104223413 is an apocalyptic number.
It is an amenable number.
1104223413 is a deficient number, since it is larger than the sum of its proper divisors (368074475).
1104223413 is an equidigital number, since it uses as much as digits as its factorization.
1104223413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 368074474.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1104223413 is about 33229.8572521761. The cubic root of 1104223413 is about 1033.5995631631.
Adding to 1104223413 its reverse (3143224011), we get a palindrome (4247447424).
The spelling of 1104223413 in words is "one billion, one hundred four million, two hundred twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •