Base | Representation |
---|---|
bin | 110000001001100101… |
… | …1111010001110101101 |
3 | 100212220012102100020200 |
4 | 1200103023322032231 |
5 | 3143231140314201 |
6 | 115300220304113 |
7 | 10320242612325 |
oct | 1402313721655 |
9 | 325805370220 |
10 | 103401104301 |
11 | 3a941256100 |
12 | 180589a2039 |
13 | 999b3310b1 |
14 | 500ca38285 |
15 | 2a52b0e386 |
hex | 18132fa3ad |
103401104301 has 36 divisors (see below), whose sum is σ = 171307272864. Its totient is φ = 59942654640.
The previous prime is 103401104299. The next prime is 103401104311.
103401104301 is a `hidden beast` number, since 10 + 340 + 1 + 10 + 4 + 301 = 666.
103401104301 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 103401104301 - 21 = 103401104299 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103401104311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2039095 + ... + 2089188.
Almost surely, 2103401104301 is an apocalyptic number.
103401104301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103401104301 is a deficient number, since it is larger than the sum of its proper divisors (67906168563).
103401104301 is a wasteful number, since it uses less digits than its factorization.
103401104301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4128334 (or 4128320 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
It can be divided in two parts, 103401 and 104301, that added together give a palindrome (207702).
The spelling of 103401104301 in words is "one hundred three billion, four hundred one million, one hundred four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •