Base | Representation |
---|---|
bin | 1011000000101010101000… |
… | …00001110010000111001111 |
3 | 10011201122202200202011112121 |
4 | 11200111110001302013033 |
5 | 11133142430420313403 |
6 | 123254523113113411 |
7 | 5046161260466314 |
oct | 540252401620717 |
9 | 104648680664477 |
10 | 24212140401103 |
11 | 7795347057946 |
12 | 28705849b8867 |
13 | 106826c680c15 |
14 | 5d9c33ba6d0b |
15 | 2bec3001b3bd |
hex | 1605540721cf |
24212140401103 has 8 divisors (see below), whose sum is σ = 24802895703600. Its totient is φ = 23621395350720.
The previous prime is 24212140401101. The next prime is 24212140401109. The reversal of 24212140401103 is 30110404121242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 24212140401103 - 21 = 24212140401101 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 (24212140401101) 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 7 ways as a sum of consecutive naturals, for example, 2330548 + ... + 7338646.
It is an arithmetic number, because the mean of its divisors is an integer number (3100361962950).
Almost surely, 224212140401103 is an apocalyptic number.
24212140401103 is a deficient number, since it is larger than the sum of its proper divisors (590755302497).
24212140401103 is a wasteful number, since it uses less digits than its factorization.
24212140401103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5126057.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 24212140401103 its reverse (30110404121242), we get a palindrome (54322544522345).
The spelling of 24212140401103 in words is "twenty-four trillion, two hundred twelve billion, one hundred forty million, four hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •