Base | Representation |
---|---|
bin | 11000011001111000… |
… | …01010111101010001 |
3 | 1020211002201122220101 |
4 | 30030330022331101 |
5 | 203313103031001 |
6 | 10004033212401 |
7 | 642452115364 |
oct | 141474127521 |
9 | 36732648811 |
10 | 13102002001 |
11 | 5613814030 |
12 | 2657a01101 |
13 | 130a56680a |
14 | 8c411c0db |
15 | 51a39ea01 |
hex | 30cf0af51 |
13102002001 has 8 divisors (see below), whose sum is σ = 14297220000. Its totient is φ = 11907471840.
The previous prime is 13102001999. The next prime is 13102002071. The reversal of 13102002001 is 10020020131.
13102002001 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 not a de Polignac number, because 13102002001 - 21 = 13102001999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13102002071) 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, 131716 + ... + 208693.
It is an arithmetic number, because the mean of its divisors is an integer number (1787152500).
Almost surely, 213102002001 is an apocalyptic number.
13102002001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13102002001 is a deficient number, since it is larger than the sum of its proper divisors (1195217999).
13102002001 is a wasteful number, since it uses less digits than its factorization.
13102002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343919.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 13102002001 its reverse (10020020131), we get a palindrome (23122022132).
The spelling of 13102002001 in words is "thirteen billion, one hundred two million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •