Base | Representation |
---|---|
bin | 110011010100… |
… | …101100101010 |
3 | 221022112120211 |
4 | 303110230222 |
5 | 11421012442 |
6 | 1200211334 |
7 | 222233563 |
oct | 63245452 |
9 | 27275524 |
10 | 13454122 |
11 | 765a310 |
12 | 4609b4a |
13 | 2a30b26 |
14 | 1b0316a |
15 | 12ab617 |
hex | cd4b2a |
13454122 has 8 divisors (see below), whose sum is σ = 22015872. Its totient is φ = 6115500.
The previous prime is 13454113. The next prime is 13454131. The reversal of 13454122 is 22145431.
13454122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13454113) and next prime (13454131).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 611551 = 13454122 / (1 + 3 + 4 + 5 + 4 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 13454093 and 13454102.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 305754 + ... + 305797.
It is an arithmetic number, because the mean of its divisors is an integer number (2751984).
Almost surely, 213454122 is an apocalyptic number.
13454122 is a deficient number, since it is larger than the sum of its proper divisors (8561750).
13454122 is a wasteful number, since it uses less digits than its factorization.
13454122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 611564.
The product of its digits is 960, while the sum is 22.
The square root of 13454122 is about 3667.9860959388. The cubic root of 13454122 is about 237.8401228358.
Adding to 13454122 its reverse (22145431), we get a palindrome (35599553).
The spelling of 13454122 in words is "thirteen million, four hundred fifty-four thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •