Base | Representation |
---|---|
bin | 1001101001101011001001… |
… | …00101110001011100101000 |
3 | 2210010220120210110210021202 |
4 | 10310311210211301130220 |
5 | 10240204422441024000 |
6 | 113045433414423332 |
7 | 4320214503200255 |
oct | 464654445613450 |
9 | 83126523423252 |
10 | 21223121033000 |
11 | 68427475a0467 |
12 | 2469224361b48 |
13 | bac440a56a53 |
14 | 5352c137c42c |
15 | 26c0de7dcdd5 |
hex | 134d64971728 |
21223121033000 has 64 divisors (see below), whose sum is σ = 49700935065600. Its totient is φ = 8482610491200.
The previous prime is 21223121032999. The next prime is 21223121033003. The reversal of 21223121033000 is 33012132212.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (21223121033003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7017764 + ... + 9575763.
It is an arithmetic number, because the mean of its divisors is an integer number (776577110400).
Almost surely, 221223121033000 is an apocalyptic number.
21223121033000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21223121033000 is an abundant number, since it is smaller than the sum of its proper divisors (28477814032600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21223121033000 is a wasteful number, since it uses less digits than its factorization.
21223121033000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16594827 (or 16594813 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 21223121033000 its reverse (33012132212), we get a palindrome (21256133165212).
The spelling of 21223121033000 in words is "twenty-one trillion, two hundred twenty-three billion, one hundred twenty-one million, thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •