Base | Representation |
---|---|
bin | 1111011011110100111011… |
… | …0110000011001111111111 |
3 | 2020002101102221122222222020 |
4 | 3312331032312003033333 |
5 | 4211022033034002211 |
6 | 100032125532451223 |
7 | 3401044502544531 |
oct | 366751666031777 |
9 | 66071387588866 |
10 | 16970738578431 |
11 | 5453282557230 |
12 | 1aa1062019b13 |
13 | 961445417901 |
14 | 429561057851 |
15 | 1e66ab7ab306 |
hex | f6f4ed833ff |
16970738578431 has 8 divisors (see below), whose sum is σ = 24684710659584. Its totient is φ = 10285296108120.
The previous prime is 16970738578427. The next prime is 16970738578433. The reversal of 16970738578431 is 13487583707961.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16970738578431 - 22 = 16970738578427 is a prime.
It is a super-2 number, since 2×169707385784312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16970738578433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 257132402671 + ... + 257132402736.
It is an arithmetic number, because the mean of its divisors is an integer number (3085588832448).
Almost surely, 216970738578431 is an apocalyptic number.
16970738578431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
16970738578431 is a deficient number, since it is larger than the sum of its proper divisors (7713972081153).
16970738578431 is a wasteful number, since it uses less digits than its factorization.
16970738578431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 514264805421.
The product of its (nonzero) digits is 213373440, while the sum is 69.
The spelling of 16970738578431 in words is "sixteen trillion, nine hundred seventy billion, seven hundred thirty-eight million, five hundred seventy-eight thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •