Base | Representation |
---|---|
bin | 10010110111110110… |
… | …11100001111110001 |
3 | 222011010121022000121 |
4 | 21123323130033301 |
5 | 131222323242231 |
6 | 4353225050241 |
7 | 506041435225 |
oct | 113373341761 |
9 | 28133538017 |
10 | 10132243441 |
11 | 432a429511 |
12 | 1b69326981 |
13 | c56210128 |
14 | 6c1948785 |
15 | 3e47d1311 |
hex | 25bedc3f1 |
10132243441 has 4 divisors (see below), whose sum is σ = 10136153572. Its totient is φ = 10128333312.
The previous prime is 10132243439. The next prime is 10132243481. The reversal of 10132243441 is 14434223101.
10132243441 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 4345446400 + 5786797041 = 65920^2 + 76071^2 .
It is a cyclic number.
It is not a de Polignac number, because 10132243441 - 21 = 10132243439 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10132243481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1951176 + ... + 1956361.
It is an arithmetic number, because the mean of its divisors is an integer number (2534038393).
Almost surely, 210132243441 is an apocalyptic number.
It is an amenable number.
10132243441 is a deficient number, since it is larger than the sum of its proper divisors (3910131).
10132243441 is an equidigital number, since it uses as much as digits as its factorization.
10132243441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3910130.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10132243441 its reverse (14434223101), we get a palindrome (24566466542).
The spelling of 10132243441 in words is "ten billion, one hundred thirty-two million, two hundred forty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •