Base | Representation |
---|---|
bin | 110010101000… |
… | …110101010010 |
3 | 220222102010022 |
4 | 302220311102 |
5 | 11344240300 |
6 | 1152303442 |
7 | 220555010 |
oct | 62506522 |
9 | 26872108 |
10 | 13274450 |
11 | 7547322 |
12 | 4541b82 |
13 | 299a107 |
14 | 1a978b0 |
15 | 1273285 |
hex | ca8d52 |
13274450 has 96 divisors (see below), whose sum is σ = 31497984. Its totient is φ = 4055040.
The previous prime is 13274423. The next prime is 13274477. The reversal of 13274450 is 5447231.
It is an interprime number because it is at equal distance from previous prime (13274423) and next prime (13274477).
It is a super-2 number, since 2×132744502 = 352422045605000, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 136802 + ... + 136898.
It is an arithmetic number, because the mean of its divisors is an integer number (328104).
Almost surely, 213274450 is an apocalyptic number.
13274450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13274450 is the 2975-th pentagonal number.
13274450 is an abundant number, since it is smaller than the sum of its proper divisors (18223534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13274450 is a wasteful number, since it uses less digits than its factorization.
13274450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156 (or 151 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 26.
The square root of 13274450 is about 3643.4118625267. The cubic root of 13274450 is about 236.7766356186.
The spelling of 13274450 in words is "thirteen million, two hundred seventy-four thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •