Base | Representation |
---|---|
bin | 1001100110101101001111… |
… | …00011110001010000111100 |
3 | 2202210011102022220021201020 |
4 | 10303112213203301100330 |
5 | 10232022121313210312 |
6 | 112530532430544140 |
7 | 4306645111263543 |
oct | 463264743612074 |
9 | 82704368807636 |
10 | 21121165366332 |
11 | 6803488249019 |
12 | 245150b668050 |
13 | ba2943022cc5 |
14 | 5303ac6c315a |
15 | 269623a4b78c |
hex | 1335a78f143c |
21121165366332 has 48 divisors (see below), whose sum is σ = 50715496161792. Its totient is φ = 6837992986240.
The previous prime is 21121165366309. The next prime is 21121165366337. The reversal of 21121165366332 is 23366356112112.
It is a happy number.
It is a super-2 number, since 2×211211653663322 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21121165366337) 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 15 ways as a sum of consecutive naturals, for example, 142860753 + ... + 143008520.
It is an arithmetic number, because the mean of its divisors is an integer number (1056572836704).
Almost surely, 221121165366332 is an apocalyptic number.
It is an amenable number.
21121165366332 is an abundant number, since it is smaller than the sum of its proper divisors (29594330795460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21121165366332 is a wasteful number, since it uses less digits than its factorization.
21121165366332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285869458 (or 285869456 counting only the distinct ones).
The product of its digits is 233280, while the sum is 42.
The spelling of 21121165366332 in words is "twenty-one trillion, one hundred twenty-one billion, one hundred sixty-five million, three hundred sixty-six thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •