Base | Representation |
---|---|
bin | 10010010110111001… |
… | …010010111011001110 |
3 | 1212212201121111021222 |
4 | 102112321102323032 |
5 | 310332114040220 |
6 | 13015541123342 |
7 | 1265316512246 |
oct | 222671227316 |
9 | 55781544258 |
10 | 19711471310 |
11 | 83a5680163 |
12 | 39a13b9552 |
13 | 1b219952bb |
14 | d4dc5ab26 |
15 | 7a5775e25 |
hex | 496e52ece |
19711471310 has 16 divisors (see below), whose sum is σ = 35660756736. Its totient is φ = 7844564448.
The previous prime is 19711471271. The next prime is 19711471331. The reversal of 19711471310 is 1317411791.
It is a super-3 number, since 3×197114713103 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5000942 + ... + 5004881.
It is an arithmetic number, because the mean of its divisors is an integer number (2228797296).
Almost surely, 219711471310 is an apocalyptic number.
19711471310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
19711471310 is a deficient number, since it is larger than the sum of its proper divisors (15949285426).
19711471310 is a wasteful number, since it uses less digits than its factorization.
19711471310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10006027.
The product of its (nonzero) digits is 5292, while the sum is 35.
The spelling of 19711471310 in words is "nineteen billion, seven hundred eleven million, four hundred seventy-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •