Base | Representation |
---|---|
bin | 11001110101111011… |
… | …00010111111100111 |
3 | 1022210220121001011220 |
4 | 30322331202333213 |
5 | 211403233131120 |
6 | 10212414231423 |
7 | 1000546012341 |
oct | 147275427747 |
9 | 38726531156 |
10 | 13874114535 |
11 | 597a637666 |
12 | 28324b5573 |
13 | 1401504138 |
14 | 9588a8291 |
15 | 563068b40 |
hex | 33af62fe7 |
13874114535 has 16 divisors (see below), whose sum is σ = 22220097504. Its totient is φ = 7392356352.
The previous prime is 13874114531. The next prime is 13874114539. The reversal of 13874114535 is 53541147831.
It is an interprime number because it is at equal distance from previous prime (13874114531) and next prime (13874114539).
It is not a de Polignac number, because 13874114535 - 22 = 13874114531 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13874114531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 432202 + ... + 463191.
It is an arithmetic number, because the mean of its divisors is an integer number (1388756094).
Almost surely, 213874114535 is an apocalyptic number.
13874114535 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13874114535 is a deficient number, since it is larger than the sum of its proper divisors (8345982969).
13874114535 is a wasteful number, since it uses less digits than its factorization.
13874114535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896434.
The product of its digits is 201600, while the sum is 42.
It can be divided in two parts, 1387411 and 4535, that added together give a triangular number (1391946 = T1668).
The spelling of 13874114535 in words is "thirteen billion, eight hundred seventy-four million, one hundred fourteen thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •