Base | Representation |
---|---|
bin | 11000101100001111… |
… | …01000110111000110 |
3 | 1021012211111201120121 |
4 | 30112013220313012 |
5 | 204122014044024 |
6 | 10031214052154 |
7 | 646332111052 |
oct | 142607506706 |
9 | 37184451517 |
10 | 13256003014 |
11 | 56927392a1 |
12 | 269b4aa05a |
13 | 1333436887 |
14 | 8da768c62 |
15 | 528b6e8e4 |
hex | 3161e8dc6 |
13256003014 has 4 divisors (see below), whose sum is σ = 19884004524. Its totient is φ = 6628001506.
The previous prime is 13256003009. The next prime is 13256003017. The reversal of 13256003014 is 41030065231.
13256003014 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 41030065231 = 331 ⋅123957901.
It is a self number, because there is not a number n which added to its sum of digits gives 13256003014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13256003017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3314000752 + ... + 3314000755.
It is an arithmetic number, because the mean of its divisors is an integer number (4971001131).
Almost surely, 213256003014 is an apocalyptic number.
13256003014 is a deficient number, since it is larger than the sum of its proper divisors (6628001510).
13256003014 is an equidigital number, since it uses as much as digits as its factorization.
13256003014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6628001509.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 13256003014 its reverse (41030065231), we get a palindrome (54286068245).
The spelling of 13256003014 in words is "thirteen billion, two hundred fifty-six million, three thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •