Base | Representation |
---|---|
bin | 101111111101101011… |
… | …0011010000110011101 |
3 | 100211212022221020221010 |
4 | 1133323112122012131 |
5 | 3141421301444401 |
6 | 115152413125433 |
7 | 10304315531526 |
oct | 1377326320635 |
9 | 324768836833 |
10 | 103001203101 |
11 | 3a756548445 |
12 | 17b66a89879 |
13 | 9936525774 |
14 | 4db189b84d |
15 | 2a2c969ed6 |
hex | 17fb59a19d |
103001203101 has 8 divisors (see below), whose sum is σ = 137336519104. Its totient is φ = 68666677920.
The previous prime is 103001203099. The next prime is 103001203111. The reversal of 103001203101 is 101302100301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103001203101 - 21 = 103001203099 is a prime.
It is a super-4 number, since 4×1030012031014 (a number of 45 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103001203111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 252960 + ... + 519606.
It is an arithmetic number, because the mean of its divisors is an integer number (17167064888).
Almost surely, 2103001203101 is an apocalyptic number.
It is an amenable number.
103001203101 is a deficient number, since it is larger than the sum of its proper divisors (34335316003).
103001203101 is a wasteful number, since it uses less digits than its factorization.
103001203101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395411.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 103001203101 its reverse (101302100301), we get a palindrome (204303303402).
The spelling of 103001203101 in words is "one hundred three billion, one million, two hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •