Base | Representation |
---|---|
bin | 10000000011101001101… |
… | …100001100011100010001 |
3 | 10220111011002112220012222 |
4 | 100003221230030130101 |
5 | 121034312132220101 |
6 | 2202524303430425 |
7 | 142502036555630 |
oct | 20035154143421 |
9 | 3814132486188 |
10 | 1103432304401 |
11 | 395a658510a9 |
12 | 159a292b5415 |
13 | 8008cc01c1b |
14 | 3b599283517 |
15 | 1da81e8a01b |
hex | 100e9b0c711 |
1103432304401 has 8 divisors (see below), whose sum is σ = 1272851150400. Its totient is φ = 936959873328.
The previous prime is 1103432304397. The next prime is 1103432304407. The reversal of 1103432304401 is 1044032343011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1103432304401 - 22 = 1103432304397 is a prime.
It is a super-2 number, since 2×11034323044012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1103432304407) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 736602926 + ... + 736604423.
It is an arithmetic number, because the mean of its divisors is an integer number (159106393800).
Almost surely, 21103432304401 is an apocalyptic number.
It is an amenable number.
1103432304401 is a deficient number, since it is larger than the sum of its proper divisors (169418845999).
1103432304401 is a wasteful number, since it uses less digits than its factorization.
1103432304401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1473207463.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 1103432304401 its reverse (1044032343011), we get a palindrome (2147464647412).
The spelling of 1103432304401 in words is "one trillion, one hundred three billion, four hundred thirty-two million, three hundred four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •