Base | Representation |
---|---|
bin | 110000000000101001… |
… | …1000111010100000101 |
3 | 100212010021201121200011 |
4 | 1200001103013110011 |
5 | 3142122324044023 |
6 | 115210340150221 |
7 | 10306640031421 |
oct | 1400123072405 |
9 | 325107647604 |
10 | 103101003013 |
11 | 3a7a7912608 |
12 | 17b94398371 |
13 | 99510c9178 |
14 | 4dc0c39b81 |
15 | 2a365d050d |
hex | 18014c7505 |
103101003013 has 8 divisors (see below), whose sum is σ = 104569214976. Its totient is φ = 101633238000.
The previous prime is 103101002899. The next prime is 103101003053. The reversal of 103101003013 is 310300101301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103101003013 - 229 = 102564132101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103101002984 and 103101003002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103101003053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 367420 + ... + 584122.
It is an arithmetic number, because the mean of its divisors is an integer number (13071151872).
Almost surely, 2103101003013 is an apocalyptic number.
It is an amenable number.
103101003013 is a deficient number, since it is larger than the sum of its proper divisors (1468211963).
103101003013 is an equidigital number, since it uses as much as digits as its factorization.
103101003013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223475.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 103101003013 its reverse (310300101301), we get a palindrome (413401104314).
The spelling of 103101003013 in words is "one hundred three billion, one hundred one million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •