Base | Representation |
---|---|
bin | 11001100000000101… |
… | …10011111000101111 |
3 | 1022100010221001220200 |
4 | 30300002303320233 |
5 | 211014340220241 |
6 | 10142312244543 |
7 | 663163053516 |
oct | 146002637057 |
9 | 38303831820 |
10 | 13690945071 |
11 | 58961aa741 |
12 | 27a10a0753 |
13 | 13a259073b |
14 | 93c42767d |
15 | 551e364b6 |
hex | 3300b3e2f |
13690945071 has 12 divisors (see below), whose sum is σ = 19858556640. Its totient is φ = 9089105760.
The previous prime is 13690945067. The next prime is 13690945097. The reversal of 13690945071 is 17054909631.
13690945071 is a `hidden beast` number, since 136 + 9 + 0 + 9 + 4 + 507 + 1 = 666.
13690945071 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13690945071 - 22 = 13690945067 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13690945571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3180310 + ... + 3184611.
It is an arithmetic number, because the mean of its divisors is an integer number (1654879720).
Almost surely, 213690945071 is an apocalyptic number.
13690945071 is a deficient number, since it is larger than the sum of its proper divisors (6167611569).
13690945071 is a wasteful number, since it uses less digits than its factorization.
13690945071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6365166 (or 6365163 counting only the distinct ones).
The product of its (nonzero) digits is 204120, while the sum is 45.
The spelling of 13690945071 in words is "thirteen billion, six hundred ninety million, nine hundred forty-five thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •