Base | Representation |
---|---|
bin | 10011001011111000… |
… | …11010011101101001 |
3 | 222120211202221201211 |
4 | 21211330122131221 |
5 | 132043332123231 |
6 | 4422030313121 |
7 | 513151565656 |
oct | 114574323551 |
9 | 28524687654 |
10 | 10300270441 |
11 | 44062636aa |
12 | 1bb56587a1 |
13 | c81c813a6 |
14 | 6d9da6c2d |
15 | 404421eb1 |
hex | 265f1a769 |
10300270441 has 4 divisors (see below), whose sum is σ = 10300592512. Its totient is φ = 10299948372.
The previous prime is 10300270429. The next prime is 10300270457. The reversal of 10300270441 is 14407200301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14407200301 = 13 ⋅1108246177.
It is a cyclic number.
It is not a de Polignac number, because 10300270441 - 27 = 10300270313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10300270411) 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, 107025 + ... + 179038.
It is an arithmetic number, because the mean of its divisors is an integer number (2575148128).
Almost surely, 210300270441 is an apocalyptic number.
It is an amenable number.
10300270441 is a deficient number, since it is larger than the sum of its proper divisors (322071).
10300270441 is an equidigital number, since it uses as much as digits as its factorization.
10300270441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322070.
The product of its (nonzero) digits is 672, while the sum is 22.
Adding to 10300270441 its reverse (14407200301), we get a palindrome (24707470742).
The spelling of 10300270441 in words is "ten billion, three hundred million, two hundred seventy thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •