Base | Representation |
---|---|
bin | 101111111110010000… |
… | …0000010001111101101 |
3 | 100211220200020211211220 |
4 | 1133330200002033231 |
5 | 3141441222112140 |
6 | 115154342533553 |
7 | 10304641556514 |
oct | 1377440021755 |
9 | 324820224756 |
10 | 103020504045 |
11 | 3a766430538 |
12 | 17b714372b9 |
13 | 993a522944 |
14 | 4db428367b |
15 | 2a2e4cdbd0 |
hex | 17fc8023ed |
103020504045 has 8 divisors (see below), whose sum is σ = 164832806496. Its totient is φ = 54944268816.
The previous prime is 103020504031. The next prime is 103020504049. The reversal of 103020504045 is 540405020301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103020504045 - 29 = 103020503533 is a prime.
It is a super-2 number, since 2×1030205040452 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103020504049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3434016787 + ... + 3434016816.
It is an arithmetic number, because the mean of its divisors is an integer number (20604100812).
Almost surely, 2103020504045 is an apocalyptic number.
103020504045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
103020504045 is a deficient number, since it is larger than the sum of its proper divisors (61812302451).
103020504045 is an equidigital number, since it uses as much as digits as its factorization.
103020504045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6868033611.
The product of its (nonzero) digits is 2400, while the sum is 24.
Adding to 103020504045 its reverse (540405020301), we get a palindrome (643425524346).
The spelling of 103020504045 in words is "one hundred three billion, twenty million, five hundred four thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •