Base | Representation |
---|---|
bin | 1011110101011101010100… |
… | …0010110001001000011001 |
3 | 1201002000220110010212222102 |
4 | 2331113111002301020121 |
5 | 3201201141213241441 |
6 | 43402034211133145 |
7 | 2512106006520122 |
oct | 275272502611031 |
9 | 51060813125872 |
10 | 13013030212121 |
11 | 416788233aa45 |
12 | 15620195a41b5 |
13 | 73517b3a77c4 |
14 | 32db967b7049 |
15 | 1787735a569b |
hex | bd5d50b1219 |
13013030212121 has 8 divisors (see below), whose sum is σ = 13085040105984. Its totient is φ = 12941060723280.
The previous prime is 13013030212079. The next prime is 13013030212129. The reversal of 13013030212121 is 12121203031031.
It is a happy number.
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 13013030212121 - 26 = 13013030212057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13013030212093 and 13013030212102.
It is not an unprimeable number, because it can be changed into a prime (13013030212129) 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, 9455231 + ... + 10743716.
It is an arithmetic number, because the mean of its divisors is an integer number (1635630013248).
Almost surely, 213013030212121 is an apocalyptic number.
It is an amenable number.
13013030212121 is a deficient number, since it is larger than the sum of its proper divisors (72009893863).
13013030212121 is a wasteful number, since it uses less digits than its factorization.
13013030212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20202511.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13013030212121 its reverse (12121203031031), we get a palindrome (25134233243152).
The spelling of 13013030212121 in words is "thirteen trillion, thirteen billion, thirty million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •