Base | Representation |
---|---|
bin | 10011011011101110… |
… | …01110111100000001 |
3 | 222221002202221010011 |
4 | 21231313032330001 |
5 | 132331340131431 |
6 | 4443134104521 |
7 | 516354100222 |
oct | 115567167401 |
9 | 28832687104 |
10 | 10433130241 |
11 | 4474259196 |
12 | 203204b141 |
13 | ca365b761 |
14 | 70d8ad249 |
15 | 410e17cb1 |
hex | 26ddcef01 |
10433130241 has 4 divisors (see below), whose sum is σ = 10715106772. Its totient is φ = 10151153712.
The previous prime is 10433130221. The next prime is 10433130247. The reversal of 10433130241 is 14203133401.
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 8540532225 + 1892598016 = 92415^2 + 43504^2 .
It is a cyclic number.
It is not a de Polignac number, because 10433130241 - 211 = 10433128193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10433130247) 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, 140988210 + ... + 140988283.
It is an arithmetic number, because the mean of its divisors is an integer number (2678776693).
Almost surely, 210433130241 is an apocalyptic number.
It is an amenable number.
10433130241 is a deficient number, since it is larger than the sum of its proper divisors (281976531).
10433130241 is an equidigital number, since it uses as much as digits as its factorization.
10433130241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281976530.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10433130241 its reverse (14203133401), we get a palindrome (24636263642).
The spelling of 10433130241 in words is "ten billion, four hundred thirty-three million, one hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •