Base | Representation |
---|---|
bin | 110011010110… |
… | …111100100010 |
3 | 221100000012212 |
4 | 303112330202 |
5 | 11421311310 |
6 | 1200322122 |
7 | 222302456 |
oct | 63267442 |
9 | 27300185 |
10 | 13463330 |
11 | 7666221 |
12 | 4613342 |
13 | 2a3508a |
14 | 1b06666 |
15 | 12ae205 |
hex | cd6f22 |
13463330 has 8 divisors (see below), whose sum is σ = 24234012. Its totient is φ = 5385328.
The previous prime is 13463327. The next prime is 13463339. The reversal of 13463330 is 3336431.
It can be written as a sum of positive squares in 2 ways, for example, as 12229009 + 1234321 = 3497^2 + 1111^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×134633302 = 362522509377800, which contains 22 as substring.
It is a nialpdrome in base 11.
It is a junction number, because it is equal to n+sod(n) for n = 13463296 and 13463305.
It is not an unprimeable number, because it can be changed into a prime (13463339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 673157 + ... + 673176.
Almost surely, 213463330 is an apocalyptic number.
13463330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13463330 is a deficient number, since it is larger than the sum of its proper divisors (10770682).
13463330 is a wasteful number, since it uses less digits than its factorization.
13463330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1346340.
The product of its (nonzero) digits is 1944, while the sum is 23.
The square root of 13463330 is about 3669.2410659427. The cubic root of 13463330 is about 237.8943697158.
Adding to 13463330 its reverse (3336431), we get a palindrome (16799761).
The spelling of 13463330 in words is "thirteen million, four hundred sixty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •