Base | Representation |
---|---|
bin | 1011110111101100010000… |
… | …1100001011001101000111 |
3 | 1201012200221122202101012021 |
4 | 2331323010030023031013 |
5 | 3202313232423434312 |
6 | 43431421551304011 |
7 | 2514634625012011 |
oct | 275730414131507 |
9 | 51180848671167 |
10 | 13051402171207 |
11 | 4182083304824 |
12 | 156954821b007 |
13 | 738985086c3a |
14 | 331996a711b1 |
15 | 17976c19ec07 |
hex | bdec430b347 |
13051402171207 has 4 divisors (see below), whose sum is σ = 13051509246520. Its totient is φ = 13051295095896.
The previous prime is 13051402171133. The next prime is 13051402171237. The reversal of 13051402171207 is 70217120415031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13051402171207 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13051402171237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53354613 + ... + 53598670.
It is an arithmetic number, because the mean of its divisors is an integer number (3262877311630).
Almost surely, 213051402171207 is an apocalyptic number.
13051402171207 is a deficient number, since it is larger than the sum of its proper divisors (107075313).
13051402171207 is a wasteful number, since it uses less digits than its factorization.
13051402171207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107075312.
The product of its (nonzero) digits is 11760, while the sum is 34.
Adding to 13051402171207 its reverse (70217120415031), we get a palindrome (83268522586238).
The spelling of 13051402171207 in words is "thirteen trillion, fifty-one billion, four hundred two million, one hundred seventy-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •