Base | Representation |
---|---|
bin | 110010100011011011110… |
… | …1010001100000010001001 |
3 | 220121020010002110121102102 |
4 | 1211012313222030002021 |
5 | 1402314043103014442 |
6 | 22435515335243145 |
7 | 1314656664342143 |
oct | 145066752140211 |
9 | 26536102417372 |
10 | 6948043407497 |
11 | 22397154063a5 |
12 | 9426b18194b5 |
13 | 3b52753cc07a |
14 | 1a0403b09c93 |
15 | c0b041bd232 |
hex | 651b7a8c089 |
6948043407497 has 8 divisors (see below), whose sum is σ = 6959267018880. Its totient is φ = 6936825042000.
The previous prime is 6948043407491. The next prime is 6948043407559. The reversal of 6948043407497 is 7947043408496.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6948043407497 - 230 = 6946969665673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6948043407491) by changing a digit.
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, 1343954 + ... + 3962612.
It is an arithmetic number, because the mean of its divisors is an integer number (869908377360).
Almost surely, 26948043407497 is an apocalyptic number.
It is an amenable number.
6948043407497 is a deficient number, since it is larger than the sum of its proper divisors (11223611383).
6948043407497 is a wasteful number, since it uses less digits than its factorization.
6948043407497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2622943.
The product of its (nonzero) digits is 146313216, while the sum is 65.
Subtracting 6948043407497 from its reverse (7947043408496), we obtain a palindrome (999000000999).
The spelling of 6948043407497 in words is "six trillion, nine hundred forty-eight billion, forty-three million, four hundred seven thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •