Base | Representation |
---|---|
bin | 110000001010011110… |
… | …0000010111010100001 |
3 | 100212222020201210120022 |
4 | 1200110330002322201 |
5 | 3143311202000001 |
6 | 115303150323225 |
7 | 10321050513143 |
oct | 1402474027241 |
9 | 325866653508 |
10 | 103430500001 |
11 | 3a956903574 |
12 | 180667b9515 |
13 | 99a4453cba |
14 | 50128cac93 |
15 | 2a554b911b |
hex | 1814f02ea1 |
103430500001 has 4 divisors (see below), whose sum is σ = 103442000004. Its totient is φ = 103419000000.
The previous prime is 103430499979. The next prime is 103430500007. The reversal of 103430500001 is 100005034301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21449067025 + 81981432976 = 146455^2 + 286324^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103430500001 is a prime.
It is a super-2 number, since 2×1034305000012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103430500007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5736500 + ... + 5754501.
It is an arithmetic number, because the mean of its divisors is an integer number (25860500001).
Almost surely, 2103430500001 is an apocalyptic number.
It is an amenable number.
103430500001 is a deficient number, since it is larger than the sum of its proper divisors (11500003).
103430500001 is an equidigital number, since it uses as much as digits as its factorization.
103430500001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11500002.
The product of its (nonzero) digits is 180, while the sum is 17.
Adding to 103430500001 its reverse (100005034301), we get a palindrome (203435534302).
The spelling of 103430500001 in words is "one hundred three billion, four hundred thirty million, five hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •