Base | Representation |
---|---|
bin | 11000111101111001… |
… | …01000000011111101 |
3 | 1021121011012101200022 |
4 | 30132330220003331 |
5 | 204422423023401 |
6 | 10054024341525 |
7 | 653111031053 |
oct | 143674500375 |
9 | 37534171608 |
10 | 13404111101 |
11 | 57592a9077 |
12 | 27210148a5 |
13 | 13580225b4 |
14 | 9122c01d3 |
15 | 536b7871b |
hex | 31ef280fd |
13404111101 has 8 divisors (see below), whose sum is σ = 13787818464. Its totient is φ = 13021531920.
The previous prime is 13404111047. The next prime is 13404111107. The reversal of 13404111101 is 10111140431.
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 13404111101 - 26 = 13404111037 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 13404111101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13404111107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 257915 + ... + 305496.
It is an arithmetic number, because the mean of its divisors is an integer number (1723477308).
Almost surely, 213404111101 is an apocalyptic number.
It is an amenable number.
13404111101 is a deficient number, since it is larger than the sum of its proper divisors (383707363).
13404111101 is an equidigital number, since it uses as much as digits as its factorization.
13404111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564091.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 13404111101 its reverse (10111140431), we get a palindrome (23515251532).
The spelling of 13404111101 in words is "thirteen billion, four hundred four million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •