Base | Representation |
---|---|
bin | 11000110110101101… |
… | …01101100110000001 |
3 | 1021102221210100011001 |
4 | 30123112231212001 |
5 | 204312010400031 |
6 | 10044032452001 |
7 | 651446526325 |
oct | 143326554601 |
9 | 37387710131 |
10 | 13343840641 |
11 | 5728282a7a |
12 | 27049aa001 |
13 | 13486ac4c1 |
14 | 9082b1985 |
15 | 531720861 |
hex | 31b5ad981 |
13343840641 has 8 divisors (see below), whose sum is σ = 13650232320. Its totient is φ = 13038385728.
The previous prime is 13343840569. The next prime is 13343840659. The reversal of 13343840641 is 14604834331.
13343840641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13343840641 - 233 = 4753906049 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 13343840641.
It is not an unprimeable number, because it can be changed into a prime (13343844641) 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 7 ways as a sum of consecutive naturals, for example, 205336 + ... + 262393.
It is an arithmetic number, because the mean of its divisors is an integer number (1706279040).
Almost surely, 213343840641 is an apocalyptic number.
It is an amenable number.
13343840641 is a deficient number, since it is larger than the sum of its proper divisors (306391679).
13343840641 is an equidigital number, since it uses as much as digits as its factorization.
13343840641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468383.
The product of its (nonzero) digits is 82944, while the sum is 37.
The spelling of 13343840641 in words is "thirteen billion, three hundred forty-three million, eight hundred forty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •