Base | Representation |
---|---|
bin | 11000011001111001… |
… | …00011001100110101 |
3 | 1020211002220201010011 |
4 | 30030330203030311 |
5 | 203313114220201 |
6 | 10004035300221 |
7 | 642453011032 |
oct | 141474431465 |
9 | 36732821104 |
10 | 13102101301 |
11 | 56138816a3 |
12 | 2657a4a671 |
13 | 130a59ca83 |
14 | 8c4146389 |
15 | 51a3be151 |
hex | 30cf23335 |
13102101301 has 8 divisors (see below), whose sum is σ = 13925587520. Its totient is φ = 12292005312.
The previous prime is 13102101289. The next prime is 13102101347. The reversal of 13102101301 is 10310120131.
13102101301 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 de Polignac number, because none of the positive numbers 2k-13102101301 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 (13102101391) 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, 3345540 + ... + 3349453.
It is an arithmetic number, because the mean of its divisors is an integer number (1740698440).
Almost surely, 213102101301 is an apocalyptic number.
It is an amenable number.
13102101301 is a deficient number, since it is larger than the sum of its proper divisors (823486219).
13102101301 is a wasteful number, since it uses less digits than its factorization.
13102101301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6695115.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 13102101301 its reverse (10310120131), we get a palindrome (23412221432).
The spelling of 13102101301 in words is "thirteen billion, one hundred two million, one hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •