Base | Representation |
---|---|
bin | 110010100000100000000… |
… | …0101111100100100010111 |
3 | 220120121211222002212000001 |
4 | 1211001000011330210113 |
5 | 1402213142031412332 |
6 | 22432554212032131 |
7 | 1314344564161402 |
oct | 145010005744427 |
9 | 26517758085001 |
10 | 6941742450967 |
11 | 2236a81708505 |
12 | 941433602647 |
13 | 3b47acb8c01c |
14 | 19dda6d58d39 |
15 | c0885e380e7 |
hex | 6504017c917 |
6941742450967 has 4 divisors (see below), whose sum is σ = 7111053242496. Its totient is φ = 6772431659440.
The previous prime is 6941742450919. The next prime is 6941742450989. The reversal of 6941742450967 is 7690542471496.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 6941742450967 - 211 = 6941742448919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6941742450899 and 6941742450908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6941742450997) 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 3 ways as a sum of consecutive naturals, for example, 84655395703 + ... + 84655395784.
It is an arithmetic number, because the mean of its divisors is an integer number (1777763310624).
Almost surely, 26941742450967 is an apocalyptic number.
6941742450967 is a deficient number, since it is larger than the sum of its proper divisors (169310791529).
6941742450967 is a wasteful number, since it uses less digits than its factorization.
6941742450967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169310791528.
The product of its (nonzero) digits is 91445760, while the sum is 64.
The spelling of 6941742450967 in words is "six trillion, nine hundred forty-one billion, seven hundred forty-two million, four hundred fifty thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •