Base | Representation |
---|---|
bin | 1011000110001010011110… |
… | …11000110001010100010101 |
3 | 10012101201100111202001011210 |
4 | 11203011033120301110111 |
5 | 11144241313010231401 |
6 | 123521403350452033 |
7 | 5065626355115106 |
oct | 543051730612425 |
9 | 105351314661153 |
10 | 24401041102101 |
11 | 7858472628464 |
12 | 28a1103364019 |
13 | 1080015319041 |
14 | 605033b2a3ad |
15 | 2c4ad8d394d6 |
hex | 16314f631515 |
24401041102101 has 8 divisors (see below), whose sum is σ = 32560159098880. Its totient is φ = 16254641920032.
The previous prime is 24401041102091. The next prime is 24401041102153. The reversal of 24401041102101 is 10120114010442.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 24401041102101 - 227 = 24400906884373 is a prime.
It is a super-2 number, since 2×244010411021012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (24401041102181) 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, 3179699200 + ... + 3179706873.
It is an arithmetic number, because the mean of its divisors is an integer number (4070019887360).
Almost surely, 224401041102101 is an apocalyptic number.
It is an amenable number.
24401041102101 is a deficient number, since it is larger than the sum of its proper divisors (8159117996779).
24401041102101 is a wasteful number, since it uses less digits than its factorization.
24401041102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6359407355.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 24401041102101 its reverse (10120114010442), we get a palindrome (34521155112543).
The spelling of 24401041102101 in words is "twenty-four trillion, four hundred one billion, forty-one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •