Base | Representation |
---|---|
bin | 1001100110011110001101… |
… | …11101010100110000011100 |
3 | 2202202101121101200020101022 |
4 | 10303033012331110300130 |
5 | 10231404113132140122 |
6 | 112523120353503312 |
7 | 4306241232562262 |
oct | 463170675246034 |
9 | 82671541606338 |
10 | 21113102224412 |
11 | 680001a874170 |
12 | 244ba3b271b38 |
13 | ba1c596a2b03 |
14 | 52dc458a0432 |
15 | 269300c2c642 |
hex | 1333c6f54c1c |
21113102224412 has 24 divisors (see below), whose sum is σ = 42428243706240. Its totient is φ = 9091766507760.
The previous prime is 21113102224411. The next prime is 21113102224439. The reversal of 21113102224412 is 21442220131112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113102224411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12627452648 + ... + 12627454319.
It is an arithmetic number, because the mean of its divisors is an integer number (1767843487760).
Almost surely, 221113102224412 is an apocalyptic number.
21113102224412 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21113102224412 is an abundant number, since it is smaller than the sum of its proper divisors (21315141481828).
21113102224412 is a wasteful number, since it uses less digits than its factorization.
21113102224412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25254907001 (or 25254906999 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 21113102224412 its reverse (21442220131112), we get a palindrome (42555322355524).
The spelling of 21113102224412 in words is "twenty-one trillion, one hundred thirteen billion, one hundred two million, two hundred twenty-four thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •