Base | Representation |
---|---|
bin | 1001100111000011010111… |
… | …00101101100101111001000 |
3 | 2202211022002011220120011120 |
4 | 10303201223211230233020 |
5 | 10232220433300003000 |
6 | 112540215250155240 |
7 | 4310545351223631 |
oct | 463415345545710 |
9 | 82738064816146 |
10 | 21133044141000 |
11 | 6808523531270 |
12 | 2453885882b20 |
13 | ba3ab7021c5c |
14 | 530bb8186888 |
15 | 269abb8236a0 |
hex | 13386b96cbc8 |
21133044141000 has 256 divisors, whose sum is σ = 73683572901120. Its totient is φ = 4998206720000.
The previous prime is 21133044140983. The next prime is 21133044141067. The reversal of 21133044141000 is 14144033112.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 6456699 + ... + 9162698.
It is an arithmetic number, because the mean of its divisors is an integer number (287826456645).
Almost surely, 221133044141000 is an apocalyptic number.
21133044141000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21133044141000 is an abundant number, since it is smaller than the sum of its proper divisors (52550528760120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21133044141000 is a wasteful number, since it uses less digits than its factorization.
21133044141000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15619473 (or 15619459 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 21133044141000 its reverse (14144033112), we get a palindrome (21147188174112).
The spelling of 21133044141000 in words is "twenty-one trillion, one hundred thirty-three billion, forty-four million, one hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •