Base | Representation |
---|---|
bin | 110101000001… |
… | …001000110111 |
3 | 222011002212200 |
4 | 311001020313 |
5 | 12024221140 |
6 | 1213515543 |
7 | 226063545 |
oct | 65011067 |
9 | 28132780 |
10 | 13898295 |
11 | 7932aa4 |
12 | 47a2bb3 |
13 | 2b58058 |
14 | 1bbad95 |
15 | 1348030 |
hex | d41237 |
13898295 has 12 divisors (see below), whose sum is σ = 24090456. Its totient is φ = 7412400.
The previous prime is 13898237. The next prime is 13898327. The reversal of 13898295 is 59289831.
It is a happy number.
It is not a de Polignac number, because 13898295 - 27 = 13898167 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45), and also a Moran number because the ratio is a prime number: 308851 = 13898295 / (1 + 3 + 8 + 9 + 8 + 2 + 9 + 5).
It is a self number, because there is not a number n which added to its sum of digits gives 13898295.
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 11 ways as a sum of consecutive naturals, for example, 154381 + ... + 154470.
It is an arithmetic number, because the mean of its divisors is an integer number (2007538).
Almost surely, 213898295 is an apocalyptic number.
13898295 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13898295 is a deficient number, since it is larger than the sum of its proper divisors (10192161).
13898295 is a wasteful number, since it uses less digits than its factorization.
13898295 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308862 (or 308859 counting only the distinct ones).
The product of its digits is 155520, while the sum is 45.
The square root of 13898295 is about 3728.0417111400. The cubic root of 13898295 is about 240.4291799781.
The spelling of 13898295 in words is "thirteen million, eight hundred ninety-eight thousand, two hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •