Base | Representation |
---|---|
bin | 11001000010010101… |
… | …11000010011110111 |
3 | 1021200202100222022112 |
4 | 30201022320103313 |
5 | 210011444331403 |
6 | 10101435521235 |
7 | 654043014143 |
oct | 144112702367 |
9 | 37622328275 |
10 | 13441402103 |
11 | 5778359388 |
12 | 27315b921b |
13 | 136297b08c |
14 | 91722a223 |
15 | 53a0929d8 |
hex | 3212b84f7 |
13441402103 has 8 divisors (see below), whose sum is σ = 13522553856. Its totient is φ = 13360363000.
The previous prime is 13441402099. The next prime is 13441402109. The reversal of 13441402103 is 30120414431.
13441402103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13441402103 - 22 = 13441402099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13441402109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 217628 + ... + 272478.
It is an arithmetic number, because the mean of its divisors is an integer number (1690319232).
Almost surely, 213441402103 is an apocalyptic number.
13441402103 is a deficient number, since it is larger than the sum of its proper divisors (81151753).
13441402103 is a wasteful number, since it uses less digits than its factorization.
13441402103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56325.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 13441402103 its reverse (30120414431), we get a palindrome (43561816534).
The spelling of 13441402103 in words is "thirteen billion, four hundred forty-one million, four hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •