Base | Representation |
---|---|
bin | 110001111110… |
… | …111110101110 |
3 | 220122200222010 |
4 | 301332332232 |
5 | 11323244042 |
6 | 1144502050 |
7 | 216242142 |
oct | 61767656 |
9 | 26580863 |
10 | 13103022 |
11 | 743a549 |
12 | 447a926 |
13 | 293a08a |
14 | 1a51222 |
15 | 123c59c |
hex | c7efae |
13103022 has 16 divisors (see below), whose sum is σ = 27747792. Its totient is φ = 4110720.
The previous prime is 13103021. The next prime is 13103023. The reversal of 13103022 is 22030131.
Added to its reverse (22030131) it gives a triangular number (35133153 = T8382).
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (13103021) and next prime (13103023).
It is a junction number, because it is equal to n+sod(n) for n = 13102989 and 13103007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13103021) 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, 64129 + ... + 64332.
It is an arithmetic number, because the mean of its divisors is an integer number (1734237).
Almost surely, 213103022 is an apocalyptic number.
13103022 is an abundant number, since it is smaller than the sum of its proper divisors (14644770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13103022 is a wasteful number, since it uses less digits than its factorization.
13103022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128483.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 13103022 is about 3619.8096635044. The cubic root of 13103022 is about 235.7529613568.
Adding to 13103022 its reverse (22030131), we get a palindrome (35133153).
The spelling of 13103022 in words is "thirteen million, one hundred three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •