Base | Representation |
---|---|
bin | 1100001000011111011111… |
… | …0000111001000010111001 |
3 | 1202020021221122101121010020 |
4 | 3002013313300321002321 |
5 | 3222030340220234001 |
6 | 44212154132441053 |
7 | 2544533246104620 |
oct | 302076760710271 |
9 | 52207848347106 |
10 | 13340030243001 |
11 | 4283525331050 |
12 | 15b5479179189 |
13 | 759c61bc8037 |
14 | 3419377686b7 |
15 | 182011303736 |
hex | c21f7c390b9 |
13340030243001 has 64 divisors (see below), whose sum is σ = 23481657077760. Its totient is φ = 6521808476160.
The previous prime is 13340030242949. The next prime is 13340030243021. The reversal of 13340030243001 is 10034203004331.
13340030243001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13340030243001 - 214 = 13340030226617 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13340030243021) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 62950060 + ... + 63161618.
It is an arithmetic number, because the mean of its divisors is an integer number (366900891840).
Almost surely, 213340030243001 is an apocalyptic number.
13340030243001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13340030243001 is a deficient number, since it is larger than the sum of its proper divisors (10141626834759).
13340030243001 is a wasteful number, since it uses less digits than its factorization.
13340030243001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227654.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 13340030243001 its reverse (10034203004331), we get a palindrome (23374233247332).
The spelling of 13340030243001 in words is "thirteen trillion, three hundred forty billion, thirty million, two hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •