Base | Representation |
---|---|
bin | 11001110110000000… |
… | …00000110101101001 |
3 | 1022210221210220001110 |
4 | 30323000000311221 |
5 | 211403414323230 |
6 | 10212440140533 |
7 | 1000554344304 |
oct | 147300006551 |
9 | 38727726043 |
10 | 13874761065 |
11 | 597aa39390 |
12 | 2832767749 |
13 | 140169c4b9 |
14 | 9589d5b3b |
15 | 5631454b0 |
hex | 33b000d69 |
13874761065 has 16 divisors (see below), whose sum is σ = 24217765056. Its totient is φ = 6727156800.
The previous prime is 13874761057. The next prime is 13874761081. The reversal of 13874761065 is 56016747831.
It is not a de Polignac number, because 13874761065 - 23 = 13874761057 is a prime.
It is a super-2 number, since 2×138747610652 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42044566 + ... + 42044895.
It is an arithmetic number, because the mean of its divisors is an integer number (1513610316).
Almost surely, 213874761065 is an apocalyptic number.
13874761065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13874761065 is a deficient number, since it is larger than the sum of its proper divisors (10343003991).
13874761065 is a wasteful number, since it uses less digits than its factorization.
13874761065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84089480.
The product of its (nonzero) digits is 846720, while the sum is 48.
The spelling of 13874761065 in words is "thirteen billion, eight hundred seventy-four million, seven hundred sixty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •