Base | Representation |
---|---|
bin | 1010111110101000110111… |
… | …01101011100110011111101 |
3 | 10011110222221200000111000121 |
4 | 11133110123231130303331 |
5 | 11131022242333221031 |
6 | 123202522252454541 |
7 | 5041144030445512 |
oct | 537243355346375 |
9 | 104428850014017 |
10 | 24142476070141 |
11 | 7768848391a00 |
12 | 285ab8247a451 |
13 | 1061819942800 |
14 | 5d67059ab309 |
15 | 2bd004113011 |
hex | 15f51bb5ccfd |
24142476070141 has 36 divisors (see below), whose sum is σ = 29057951924820. Its totient is φ = 20031785030400.
The previous prime is 24142476070087. The next prime is 24142476070151. The reversal of 24142476070141 is 14107067424142.
It can be written as a sum of positive squares in 6 ways, for example, as 11218781808025 + 12923694262116 = 3349445^2 + 3594954^2 .
It is not a de Polignac number, because 24142476070141 - 217 = 24142475939069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (24142476070151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 4812730 + ... + 8452651.
It is an arithmetic number, because the mean of its divisors is an integer number (807165331245).
Almost surely, 224142476070141 is an apocalyptic number.
It is an amenable number.
24142476070141 is a deficient number, since it is larger than the sum of its proper divisors (4915475854679).
24142476070141 is a wasteful number, since it uses less digits than its factorization.
24142476070141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13265518 (or 13265494 counting only the distinct ones).
The product of its (nonzero) digits is 301056, while the sum is 43.
The spelling of 24142476070141 in words is "twenty-four trillion, one hundred forty-two billion, four hundred seventy-six million, seventy thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •