Base | Representation |
---|---|
bin | 1001100110011110000101… |
… | …11001101001111010110011 |
3 | 2202202101102122120212212000 |
4 | 10303033002321221322303 |
5 | 10231403443220404101 |
6 | 112523105522505043 |
7 | 4306236445152246 |
oct | 463170271517263 |
9 | 82671378525760 |
10 | 21113034153651 |
11 | 67aaa95400640 |
12 | 244ba20505183 |
13 | ba1c4855b45b |
14 | 52dc3a82125d |
15 | 2692e9c83486 |
hex | 1333c2e69eb3 |
21113034153651 has 64 divisors (see below), whose sum is σ = 34183239751680. Its totient is φ = 12772857600000.
The previous prime is 21113034153649. The next prime is 21113034153703. The reversal of 21113034153651 is 15635143031112.
21113034153651 is a `hidden beast` number, since 2 + 1 + 1 + 1 + 30 + 3 + 41 + 536 + 51 = 666.
It is not a de Polignac number, because 21113034153651 - 21 = 21113034153649 is a prime.
It is a super-2 number, since 2×211130341536512 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21113034153611) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 511426131 + ... + 511467411.
It is an arithmetic number, because the mean of its divisors is an integer number (534113121120).
Almost surely, 221113034153651 is an apocalyptic number.
21113034153651 is a deficient number, since it is larger than the sum of its proper divisors (13070205598029).
21113034153651 is a wasteful number, since it uses less digits than its factorization.
21113034153651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44345 (or 44339 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
Adding to 21113034153651 its reverse (15635143031112), we get a palindrome (36748177184763).
The spelling of 21113034153651 in words is "twenty-one trillion, one hundred thirteen billion, thirty-four million, one hundred fifty-three thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •