Base | Representation |
---|---|
bin | 10010101010111110… |
… | …11100100001000101 |
3 | 221212121101012211101 |
4 | 21111133130201011 |
5 | 131012201204341 |
6 | 4334410140101 |
7 | 503260434031 |
oct | 112537344105 |
9 | 27777335741 |
10 | 10024241221 |
11 | 4284471885 |
12 | 1b39121631 |
13 | c39a271a7 |
14 | 6b14731c1 |
15 | 3da09a831 |
hex | 2557dc845 |
10024241221 has 8 divisors (see below), whose sum is σ = 10132020864. Its totient is φ = 9916552320.
The previous prime is 10024241209. The next prime is 10024241237. The reversal of 10024241221 is 12214242001.
10024241221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10024241221 - 217 = 10024110149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10024241621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 212436 + ... + 255298.
It is an arithmetic number, because the mean of its divisors is an integer number (1266502608).
Almost surely, 210024241221 is an apocalyptic number.
It is an amenable number.
10024241221 is a deficient number, since it is larger than the sum of its proper divisors (107779643).
10024241221 is an equidigital number, since it uses as much as digits as its factorization.
10024241221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45371.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 10024241221 its reverse (12214242001), we get a palindrome (22238483222).
The spelling of 10024241221 in words is "ten billion, twenty-four million, two hundred forty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •