Base | Representation |
---|---|
bin | 110010100111100101000… |
… | …0010001101011011000001 |
3 | 220122002002020001002202021 |
4 | 1211033022002031123001 |
5 | 1402440304024112441 |
6 | 22443550323121441 |
7 | 1315423333103221 |
oct | 145171202153301 |
9 | 26562066032667 |
10 | 6956941629121 |
11 | 2242471200a70 |
12 | 944375813281 |
13 | 3b6062a65273 |
14 | 1a0a097ca081 |
15 | c0e754933d1 |
hex | 653ca08d6c1 |
6956941629121 has 8 divisors (see below), whose sum is σ = 7644787883424. Its totient is φ = 6278328210720.
The previous prime is 6956941629103. The next prime is 6956941629181. The reversal of 6956941629121 is 1219261496596.
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 6956941629121 - 211 = 6956941627073 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6956941629121.
It is not an unprimeable number, because it can be changed into a prime (6956941629181) 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, 2308207395 + ... + 2308210408.
It is an arithmetic number, because the mean of its divisors is an integer number (955598485428).
Almost surely, 26956941629121 is an apocalyptic number.
It is an amenable number.
6956941629121 is a deficient number, since it is larger than the sum of its proper divisors (687846254303).
6956941629121 is a wasteful number, since it uses less digits than its factorization.
6956941629121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4616417951.
The product of its digits is 12597120, while the sum is 61.
The spelling of 6956941629121 in words is "six trillion, nine hundred fifty-six billion, nine hundred forty-one million, six hundred twenty-nine thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •