Base | Representation |
---|---|
bin | 1011000100001010011111… |
… | …11000110011000100001011 |
3 | 10012011010222220201110211001 |
4 | 11202011033320303010023 |
5 | 11142130102441134011 |
6 | 123430041301515431 |
7 | 5060644551424636 |
oct | 542051770630413 |
9 | 105133886643731 |
10 | 24332330021131 |
11 | 7831312a55330 |
12 | 288b928112b77 |
13 | 10766b4c29a92 |
14 | 60199638cc1d |
15 | 2c2e1697a7c1 |
hex | 16214fe3310b |
24332330021131 has 16 divisors (see below), whose sum is σ = 26966227478400. Its totient is φ = 21769373292480.
The previous prime is 24332330021093. The next prime is 24332330021141. The reversal of 24332330021131 is 13112003323342.
It is not a de Polignac number, because 24332330021131 - 227 = 24332195803403 is a prime.
It is a super-2 number, since 2×243323300211312 (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 24332330021131.
It is not an unprimeable number, because it can be changed into a prime (24332330021141) 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, 14963481 + ... + 16509706.
It is an arithmetic number, because the mean of its divisors is an integer number (1685389217400).
Almost surely, 224332330021131 is an apocalyptic number.
24332330021131 is a deficient number, since it is larger than the sum of its proper divisors (2633897457269).
24332330021131 is a wasteful number, since it uses less digits than its factorization.
24332330021131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31474314.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 24332330021131 its reverse (13112003323342), we get a palindrome (37444333344473).
The spelling of 24332330021131 in words is "twenty-four trillion, three hundred thirty-two billion, three hundred thirty million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •