Base | Representation |
---|---|
bin | 11000101100010001… |
… | …10011110101010101 |
3 | 1021012212002022211012 |
4 | 30112020303311111 |
5 | 204122103410401 |
6 | 10031224422005 |
7 | 646334530256 |
oct | 142610636525 |
9 | 37185068735 |
10 | 13256310101 |
11 | 5692928a91 |
12 | 269b617905 |
13 | 1333513598 |
14 | 8da808b2d |
15 | 528bd08bb |
hex | 316233d55 |
13256310101 has 8 divisors (see below), whose sum is σ = 13294348704. Its totient is φ = 13218313680.
The previous prime is 13256310079. The next prime is 13256310173. The reversal of 13256310101 is 10101365231.
13256310101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13256310101 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 (13256310601) 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 in 7 ways as a sum of consecutive naturals, for example, 682991 + ... + 702131.
It is an arithmetic number, because the mean of its divisors is an integer number (1661793588).
Almost surely, 213256310101 is an apocalyptic number.
It is an amenable number.
13256310101 is a deficient number, since it is larger than the sum of its proper divisors (38038603).
13256310101 is a wasteful number, since it uses less digits than its factorization.
13256310101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21091.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 13256310101 its reverse (10101365231), we get a palindrome (23357675332).
The spelling of 13256310101 in words is "thirteen billion, two hundred fifty-six million, three hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •