Base | Representation |
---|---|
bin | 1001101100110010001111… |
… | …10111011011000011100101 |
3 | 2210112010111022010201120012 |
4 | 10312121013313123003211 |
5 | 10243432331401144023 |
6 | 113210512311020005 |
7 | 4331020420406402 |
oct | 466310767330345 |
9 | 83463438121505 |
10 | 21330013303013 |
11 | 688400a489a88 |
12 | 2485a9636a605 |
13 | bb954745036c |
14 | 53a5419152a9 |
15 | 26ec98b61978 |
hex | 136647ddb0e5 |
21330013303013 has 8 divisors (see below), whose sum is σ = 21349330119936. Its totient is φ = 21310704601200.
The previous prime is 21330013303009. The next prime is 21330013303021. The reversal of 21330013303013 is 31030331003312.
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 21330013303013 - 22 = 21330013303009 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 21330013303013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21330013303513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3236648 + ... + 7289438.
It is an arithmetic number, because the mean of its divisors is an integer number (2668666264992).
Almost surely, 221330013303013 is an apocalyptic number.
It is an amenable number.
21330013303013 is a deficient number, since it is larger than the sum of its proper divisors (19316816923).
21330013303013 is a wasteful number, since it uses less digits than its factorization.
21330013303013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4057555.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 21330013303013 its reverse (31030331003312), we get a palindrome (52360344306325).
The spelling of 21330013303013 in words is "twenty-one trillion, three hundred thirty billion, thirteen million, three hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •