Base | Representation |
---|---|
bin | 1100000101010001011001… |
… | …0011010010010100011011 |
3 | 1202001000011010211112002011 |
4 | 3001110112103102110123 |
5 | 3220124040222013201 |
6 | 44130524405050351 |
7 | 2540534306600524 |
oct | 301242623222433 |
9 | 52030133745064 |
10 | 13284708001051 |
11 | 4262016375933 |
12 | 15a67b99b69b7 |
13 | 754986611c26 |
14 | 33cdaa25384b |
15 | 1808745a3151 |
hex | c15164d251b |
13284708001051 has 2 divisors, whose sum is σ = 13284708001052. Its totient is φ = 13284708001050.
The previous prime is 13284708001027. The next prime is 13284708001171. The reversal of 13284708001051 is 15010080748231.
It is a weak prime.
It is an emirp because it is prime and its reverse (15010080748231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13284708001051 - 213 = 13284707992859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13284708000995 and 13284708001013.
It is not a weakly prime, because it can be changed into another prime (13284708001021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6642354000525 + 6642354000526.
It is an arithmetic number, because the mean of its divisors is an integer number (6642354000526).
Almost surely, 213284708001051 is an apocalyptic number.
13284708001051 is a deficient number, since it is larger than the sum of its proper divisors (1).
13284708001051 is an equidigital number, since it uses as much as digits as its factorization.
13284708001051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 53760, while the sum is 40.
Adding to 13284708001051 its reverse (15010080748231), we get a palindrome (28294788749282).
The spelling of 13284708001051 in words is "thirteen trillion, two hundred eighty-four billion, seven hundred eight million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •