Base | Representation |
---|---|
bin | 110000001011001001… |
… | …1011010011110101011 |
3 | 100220000211211101122102 |
4 | 1200112103122132223 |
5 | 3143333032344201 |
6 | 115305325244015 |
7 | 10321446262655 |
oct | 1402623323653 |
9 | 326024741572 |
10 | 103453403051 |
11 | 3a968826a09 |
12 | 1807240360b |
13 | 99a91128bb |
14 | 501596d6d5 |
15 | 2a574e026b |
hex | 18164da7ab |
103453403051 has 4 divisors (see below), whose sum is σ = 103660725000. Its totient is φ = 103246081104.
The previous prime is 103453403041. The next prime is 103453403059. The reversal of 103453403051 is 150304354301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103453403051 is a prime.
It is a super-2 number, since 2×1034534030512 (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 (103453403059) 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 3 ways as a sum of consecutive naturals, for example, 103660226 + ... + 103661223.
It is an arithmetic number, because the mean of its divisors is an integer number (25915181250).
Almost surely, 2103453403051 is an apocalyptic number.
103453403051 is a deficient number, since it is larger than the sum of its proper divisors (207321949).
103453403051 is an equidigital number, since it uses as much as digits as its factorization.
103453403051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207321948.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 103453403051 its reverse (150304354301), we get a palindrome (253757757352).
The spelling of 103453403051 in words is "one hundred three billion, four hundred fifty-three million, four hundred three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •