Base | Representation |
---|---|
bin | 10011001011111111… |
… | …11110001111110001 |
3 | 222120220112100120101 |
4 | 21211333332033301 |
5 | 132044102002231 |
6 | 4422102312401 |
7 | 513162533044 |
oct | 114577761761 |
9 | 28526470511 |
10 | 10301203441 |
11 | 4406840681 |
12 | 1bb5a28701 |
13 | c82219c69 |
14 | 6da16ac5b |
15 | 404558661 |
hex | 265ffe3f1 |
10301203441 has 4 divisors (see below), whose sum is σ = 10304565232. Its totient is φ = 10297841652.
The previous prime is 10301203391. The next prime is 10301203469. The reversal of 10301203441 is 14430210301.
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.
It is a cyclic number.
It is not a de Polignac number, because 10301203441 - 215 = 10301170673 is a prime.
It is a super-2 number, since 2×103012034412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10301203141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1676295 + ... + 1682428.
It is an arithmetic number, because the mean of its divisors is an integer number (2576141308).
Almost surely, 210301203441 is an apocalyptic number.
It is an amenable number.
10301203441 is a deficient number, since it is larger than the sum of its proper divisors (3361791).
10301203441 is an equidigital number, since it uses as much as digits as its factorization.
10301203441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3361790.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10301203441 its reverse (14430210301), we get a palindrome (24731413742).
The spelling of 10301203441 in words is "ten billion, three hundred one million, two hundred three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •