Base | Representation |
---|---|
bin | 100000110110101… |
… | …1010011111001101 |
3 | 2211211101221110000 |
4 | 1001231122133031 |
5 | 4224210032023 |
6 | 301220434513 |
7 | 36214310115 |
oct | 10155323715 |
9 | 2754357400 |
10 | 1102424013 |
11 | 516320529 |
12 | 269248a39 |
13 | 14751c102 |
14 | a65b0045 |
15 | 66bb4243 |
hex | 41b5a7cd |
1102424013 has 20 divisors (see below), whose sum is σ = 1657339420. Its totient is φ = 730259712.
The previous prime is 1102424003. The next prime is 1102424033. The reversal of 1102424013 is 3104242011.
It can be written as a sum of positive squares in 2 ways, for example, as 178142409 + 924281604 = 13347^2 + 30402^2 .
It is not a de Polignac number, because 1102424013 - 210 = 1102422989 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 (1102424003) 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 19 ways as a sum of consecutive naturals, for example, 30628 + ... + 56061.
It is an arithmetic number, because the mean of its divisors is an integer number (82866971).
Almost surely, 21102424013 is an apocalyptic number.
It is an amenable number.
1102424013 is a deficient number, since it is larger than the sum of its proper divisors (554915407).
1102424013 is an equidigital number, since it uses as much as digits as its factorization.
1102424013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86858 (or 86849 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 1102424013 is about 33202.7711644676. The cubic root of 1102424013 is about 1033.0378198905.
Adding to 1102424013 its reverse (3104242011), we get a palindrome (4206666024).
The spelling of 1102424013 in words is "one billion, one hundred two million, four hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •