Base | Representation |
---|---|
bin | 1011110100101101111001… |
… | …1001101101111001000101 |
3 | 1201000211001102101001000202 |
4 | 2331023132121231321011 |
5 | 3200444104343234341 |
6 | 43352131220220245 |
7 | 2511145416316355 |
oct | 275133631557105 |
9 | 51024042331022 |
10 | 13000302321221 |
11 | 416244081a146 |
12 | 155b666b3a685 |
13 | 733c004b9907 |
14 | 32d30a240b65 |
15 | 17827aea379b |
hex | bd2de66de45 |
13000302321221 has 8 divisors (see below), whose sum is σ = 13684901973600. Its totient is φ = 12315739990320.
The previous prime is 13000302321137. The next prime is 13000302321229. The reversal of 13000302321221 is 12212320300031.
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 13000302321221 - 226 = 13000235212357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13000302321193 and 13000302321202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13000302321229) 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, 8613950 + ... + 10010031.
It is an arithmetic number, because the mean of its divisors is an integer number (1710612746700).
Almost surely, 213000302321221 is an apocalyptic number.
It is an amenable number.
13000302321221 is a deficient number, since it is larger than the sum of its proper divisors (684599652379).
13000302321221 is a wasteful number, since it uses less digits than its factorization.
13000302321221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18660739.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13000302321221 its reverse (12212320300031), we get a palindrome (25212622621252).
The spelling of 13000302321221 in words is "thirteen trillion, three hundred two million, three hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •