Base | Representation |
---|---|
bin | 1001101001101100111110… |
… | …01011011111111100010100 |
3 | 2210011000010022002202022002 |
4 | 10310312133023133330110 |
5 | 10240213431111020200 |
6 | 113050115131054432 |
7 | 4320251040244124 |
oct | 464663713377424 |
9 | 83130108082262 |
10 | 21224104001300 |
11 | 6843101441062 |
12 | 24694595a1418 |
13 | bac5695ac8b5 |
14 | 535375b34c84 |
15 | 26c14ac57bd5 |
hex | 134d9f2dff14 |
21224104001300 has 18 divisors (see below), whose sum is σ = 46056305683038. Its totient is φ = 8489641600480.
The previous prime is 21224104001297. The next prime is 21224104001311. The reversal of 21224104001300 is 310040142212.
It can be written as a sum of positive squares in 3 ways, for example, as 5577617443204 + 15646486558096 = 2361698^2 + 3955564^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 106120519907 + ... + 106120520106.
Almost surely, 221224104001300 is an apocalyptic number.
21224104001300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21224104001300 is an abundant number, since it is smaller than the sum of its proper divisors (24832201681738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21224104001300 is a wasteful number, since it uses less digits than its factorization.
21224104001300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212241040027 (or 212241040020 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 21224104001300 its reverse (310040142212), we get a palindrome (21534144143512).
The spelling of 21224104001300 in words is "twenty-one trillion, two hundred twenty-four billion, one hundred four million, one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •