Base | Representation |
---|---|
bin | 110100101011… |
… | …110000001010 |
3 | 221222122201100 |
4 | 310223300022 |
5 | 12013420243 |
6 | 1212002230 |
7 | 225250266 |
oct | 64536012 |
9 | 27878640 |
10 | 13810698 |
11 | 7883200 |
12 | 4760376 |
13 | 2b27215 |
14 | 1b970a6 |
15 | 132c0d3 |
hex | d2bc0a |
13810698 has 72 divisors (see below), whose sum is σ = 34918884. Its totient is φ = 3928320.
The previous prime is 13810691. The next prime is 13810711. The reversal of 13810698 is 89601831.
It can be written as a sum of positive squares in 2 ways, for example, as 13417569 + 393129 = 3663^2 + 627^2 .
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13810691) by changing a digit.
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 35 ways as a sum of consecutive naturals, for example, 36840 + ... + 37212.
Almost surely, 213810698 is an apocalyptic number.
13810698 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13810698, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17459442).
13810698 is an abundant number, since it is smaller than the sum of its proper divisors (21108186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13810698 is a wasteful number, since it uses less digits than its factorization.
13810698 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420 (or 406 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 36.
The square root of 13810698 is about 3716.2747476472. The cubic root of 13810698 is about 239.9229961293.
The spelling of 13810698 in words is "thirteen million, eight hundred ten thousand, six hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •