Base | Representation |
---|---|
bin | 1111010110001101101100… |
… | …0000110101010101000111 |
3 | 2012202011112101200210110001 |
4 | 3311203123000311111013 |
5 | 4202432034311424211 |
6 | 55515541003142131 |
7 | 3361062014066203 |
oct | 365433300652507 |
9 | 65664471623401 |
10 | 16874305967431 |
11 | 5416397896300 |
12 | 1a8642ab14947 |
13 | 955317a0aa43 |
14 | 424a13ad7b03 |
15 | 1e3e15840ac1 |
hex | f58db035547 |
16874305967431 has 12 divisors (see below), whose sum is σ = 18550599029536. Its totient is φ = 15337955603520.
The previous prime is 16874305967429. The next prime is 16874305967461. The reversal of 16874305967431 is 13476950347861.
It is a happy number.
It is not a de Polignac number, because 16874305967431 - 21 = 16874305967429 is a prime.
It is a super-2 number, since 2×168743059674312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16874305967461) 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 11 ways as a sum of consecutive naturals, for example, 9754290 + ... + 11353183.
Almost surely, 216874305967431 is an apocalyptic number.
16874305967431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
16874305967431 is a deficient number, since it is larger than the sum of its proper divisors (1676293062105).
16874305967431 is a wasteful number, since it uses less digits than its factorization.
16874305967431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21114102 (or 21114091 counting only the distinct ones).
The product of its (nonzero) digits is 91445760, while the sum is 64.
The spelling of 16874305967431 in words is "sixteen trillion, eight hundred seventy-four billion, three hundred five million, nine hundred sixty-seven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •