Base | Representation |
---|---|
bin | 10010101011000000… |
… | …01101110010100001 |
3 | 221212121202110200012 |
4 | 21111200031302201 |
5 | 131012224134131 |
6 | 4334414334305 |
7 | 503262234314 |
oct | 112540156241 |
9 | 27777673605 |
10 | 10024443041 |
11 | 428459a478 |
12 | 1b391ba395 |
13 | c39a98002 |
14 | 6b14c697b |
15 | 3da0da52b |
hex | 25580dca1 |
10024443041 has 8 divisors (see below), whose sum is σ = 10305948840. Its totient is φ = 9743493888.
The previous prime is 10024443019. The next prime is 10024443047. The reversal of 10024443041 is 14034442001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3537751441 + 6486691600 = 59479^2 + 80540^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10024443041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10024442998 and 10024443016.
It is not an unprimeable number, because it can be changed into a prime (10024443047) 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, 102506 + ... + 174803.
It is an arithmetic number, because the mean of its divisors is an integer number (1288243605).
Almost surely, 210024443041 is an apocalyptic number.
It is an amenable number.
10024443041 is a deficient number, since it is larger than the sum of its proper divisors (281505799).
10024443041 is an equidigital number, since it uses as much as digits as its factorization.
10024443041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278323.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 10024443041 its reverse (14034442001), we get a palindrome (24058885042).
The spelling of 10024443041 in words is "ten billion, twenty-four million, four hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •