Base | Representation |
---|---|
bin | 1010111010111001111111… |
… | …01011000101001110010011 |
3 | 10011000201221000011221102222 |
4 | 11131130333223011032103 |
5 | 11121422120441111011 |
6 | 123023552443131255 |
7 | 5025654005355143 |
oct | 535347753051623 |
9 | 104021830157388 |
10 | 24014230410131 |
11 | 7719418020435 |
12 | 283a151213b2b |
13 | 10526bc3621a0 |
14 | 5d041b4d0923 |
15 | 2b99ea2d8ddb |
hex | 15d73fac5393 |
24014230410131 has 16 divisors (see below), whose sum is σ = 26310801373920. Its totient is φ = 21782162438400.
The previous prime is 24014230410113. The next prime is 24014230410193. The reversal of 24014230410131 is 13101403241042.
It is not a de Polignac number, because 24014230410131 - 26 = 24014230410067 is a prime.
It is a super-2 number, since 2×240142304101312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 24014230410131.
It is not an unprimeable number, because it can be changed into a prime (24014230430131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4706420 + ... + 8377281.
It is an arithmetic number, because the mean of its divisors is an integer number (1644425085870).
Almost surely, 224014230410131 is an apocalyptic number.
24014230410131 is a deficient number, since it is larger than the sum of its proper divisors (2296570963789).
24014230410131 is a wasteful number, since it uses less digits than its factorization.
24014230410131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13086166.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 24014230410131 its reverse (13101403241042), we get a palindrome (37115633651173).
The spelling of 24014230410131 in words is "twenty-four trillion, fourteen billion, two hundred thirty million, four hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •