Base | Representation |
---|---|
bin | 1001101010011111100010… |
… | …01111000001110100111101 |
3 | 2210020121012011221211122221 |
4 | 10311033301033001310331 |
5 | 10241140030104241023 |
6 | 113110404550005341 |
7 | 4322231540326345 |
oct | 465176117016475 |
9 | 83217164854587 |
10 | 21251250462013 |
11 | 6853671959860 |
12 | 2472774946851 |
13 | bb1ca47203c0 |
14 | 5367cd1bdd25 |
15 | 26cbd90bd85d |
hex | 1353f13c1d3d |
21251250462013 has 16 divisors (see below), whose sum is σ = 26435121926976. Its totient is φ = 16784204394240.
The previous prime is 21251250461963. The next prime is 21251250462017. The reversal of 21251250462013 is 31026405215212.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 21251250462013 - 229 = 21250713591101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21251250462013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21251250462017) 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, 4370884131 + ... + 4370888992.
It is an arithmetic number, because the mean of its divisors is an integer number (1652195120436).
Almost surely, 221251250462013 is an apocalyptic number.
It is an amenable number.
21251250462013 is a deficient number, since it is larger than the sum of its proper divisors (5183871464963).
21251250462013 is a wasteful number, since it uses less digits than its factorization.
21251250462013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8741773164.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 21251250462013 its reverse (31026405215212), we get a palindrome (52277655677225).
The spelling of 21251250462013 in words is "twenty-one trillion, two hundred fifty-one billion, two hundred fifty million, four hundred sixty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •