Base | Representation |
---|---|
bin | 10000000011010000110… |
… | …010000100010001101101 |
3 | 10220110001222012211120021 |
4 | 100003100302010101231 |
5 | 121032433142212141 |
6 | 2202415014522141 |
7 | 142455503550604 |
oct | 20032062042155 |
9 | 3813058184507 |
10 | 1103014413421 |
11 | 395870976458 |
12 | 159931366351 |
13 | 8002446815b |
14 | 3b559982a3b |
15 | 1da5a4406d1 |
hex | 100d0c8446d |
1103014413421 has 4 divisors (see below), whose sum is σ = 1103353492732. Its totient is φ = 1102675334112.
The previous prime is 1103014413419. The next prime is 1103014413427. The reversal of 1103014413421 is 1243144103011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1093668357796 + 9346055625 = 1045786^2 + 96675^2 .
It is a cyclic number.
It is not a de Polignac number, because 1103014413421 - 21 = 1103014413419 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 (1103014413427) 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, 169534776 + ... + 169541281.
It is an arithmetic number, because the mean of its divisors is an integer number (275838373183).
Almost surely, 21103014413421 is an apocalyptic number.
It is an amenable number.
1103014413421 is a deficient number, since it is larger than the sum of its proper divisors (339079311).
1103014413421 is an equidigital number, since it uses as much as digits as its factorization.
1103014413421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339079310.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1103014413421 its reverse (1243144103011), we get a palindrome (2346158516432).
The spelling of 1103014413421 in words is "one trillion, one hundred three billion, fourteen million, four hundred thirteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.522 sec. • engine limits •