Base | Representation |
---|---|
bin | 1001100100001100110100… |
… | …01011001110001001010100 |
3 | 2202110221010012121121201112 |
4 | 10302012122023032021110 |
5 | 10224114231104400200 |
6 | 112423210433114152 |
7 | 4300505636321660 |
oct | 462063213161124 |
9 | 82427105547645 |
10 | 21035041481300 |
11 | 677aa02596530 |
12 | 24388949b8958 |
13 | b977992680a2 |
14 | 52a15c4cb8a0 |
15 | 267282b23535 |
hex | 13219a2ce254 |
21035041481300 has 72 divisors (see below), whose sum is σ = 56909348610240. Its totient is φ = 6556376563200.
The previous prime is 21035041481291. The next prime is 21035041481309. The reversal of 21035041481300 is 318414053012.
It is an interprime number because it is at equal distance from previous prime (21035041481291) and next prime (21035041481309).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21035041481309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1365904085 + ... + 1365919484.
Almost surely, 221035041481300 is an apocalyptic number.
21035041481300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21035041481300 is an abundant number, since it is smaller than the sum of its proper divisors (35874307128940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21035041481300 is a wasteful number, since it uses less digits than its factorization.
21035041481300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2731823601 (or 2731823594 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
The spelling of 21035041481300 in words is "twenty-one trillion, thirty-five billion, forty-one million, four hundred eighty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •