Base | Representation |
---|---|
bin | 1001100111010110101100… |
… | …10010000110101100001010 |
3 | 2202212021212120122011121100 |
4 | 10303223112102012230022 |
5 | 10232403213032214010 |
6 | 112545053244522230 |
7 | 4311363521354232 |
oct | 463532622065412 |
9 | 82767776564540 |
10 | 21143424101130 |
11 | 681196a773a11 |
12 | 24558a1b50376 |
13 | ba4a7c6553b6 |
14 | 5314c0974cc2 |
15 | 269ec7c372c0 |
hex | 133ad6486b0a |
21143424101130 has 96 divisors (see below), whose sum is σ = 56366881640784. Its totient is φ = 5496629419008.
The previous prime is 21143424101117. The next prime is 21143424101147. The reversal of 21143424101130 is 3110142434112.
It is a happy number.
21143424101130 is a `hidden beast` number, since 2 + 1 + 1 + 4 + 3 + 424 + 101 + 130 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 13609436675409 + 7533987425721 = 3689097^2 + 2744811^2 .
It is a junction number, because it is equal to n+sod(n) for n = 21143424101094 and 21143424101103.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13367619 + ... + 14865398.
Almost surely, 221143424101130 is an apocalyptic number.
21143424101130 is an abundant number, since it is smaller than the sum of its proper divisors (35223457539654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21143424101130 is a wasteful number, since it uses less digits than its factorization.
21143424101130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28233240 (or 28233237 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 21143424101130 its reverse (3110142434112), we get a palindrome (24253566535242).
The spelling of 21143424101130 in words is "twenty-one trillion, one hundred forty-three billion, four hundred twenty-four million, one hundred one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •