Base | Representation |
---|---|
bin | 110010100001… |
… | …000000100010 |
3 | 220220210011100 |
4 | 302201000202 |
5 | 11342224102 |
6 | 1151455230 |
7 | 220362405 |
oct | 62410042 |
9 | 26823140 |
10 | 13242402 |
11 | 7525238 |
12 | 4527516 |
13 | 2988654 |
14 | 1a89d3c |
15 | 1268a1c |
hex | ca1022 |
13242402 has 12 divisors (see below), whose sum is σ = 28691910. Its totient is φ = 4414128.
The previous prime is 13242379. The next prime is 13242407. The reversal of 13242402 is 20424231.
It can be written as a sum of positive squares in only one way, i.e., 13242321 + 81 = 3639^2 + 9^2 .
It is a super-2 number, since 2×132424022 = 350722421459208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 735689 = 13242402 / (1 + 3 + 2 + 4 + 2 + 4 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (13242407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 367827 + ... + 367862.
Almost surely, 213242402 is an apocalyptic number.
13242402 is an abundant number, since it is smaller than the sum of its proper divisors (15449508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13242402 is a wasteful number, since it uses less digits than its factorization.
13242402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 735697 (or 735694 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
The square root of 13242402 is about 3639.0111294141. The cubic root of 13242402 is about 236.5859351258.
Adding to 13242402 its reverse (20424231), we get a palindrome (33666633).
The spelling of 13242402 in words is "thirteen million, two hundred forty-two thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •