Base | Representation |
---|---|
bin | 1001100011100010100001… |
… | …01001101000110100101001 |
3 | 2202101202111121210112212011 |
4 | 10301301100221220310221 |
5 | 10223231224233320200 |
6 | 112404533233515521 |
7 | 4266043126312405 |
oct | 461612051506451 |
9 | 82352447715764 |
10 | 21012333104425 |
11 | 677130a279913 |
12 | 24343b7a12ba1 |
13 | b955ba732bb0 |
14 | 529006632105 |
15 | 2668a421a5ba |
hex | 131c50a68d29 |
21012333104425 has 12 divisors (see below), whose sum is σ = 28059546361420. Its totient is φ = 15516799830720.
The previous prime is 21012333104419. The next prime is 21012333104453. The reversal of 21012333104425 is 52440133321012.
It can be written as a sum of positive squares in 6 ways, for example, as 834305040409 + 20178028064016 = 913403^2 + 4491996^2 .
It is not a de Polignac number, because 21012333104425 - 23 = 21012333104417 is a prime.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 32326665990 + ... + 32326666639.
Almost surely, 221012333104425 is an apocalyptic number.
21012333104425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
21012333104425 is a deficient number, since it is larger than the sum of its proper divisors (7047213256995).
21012333104425 is a wasteful number, since it uses less digits than its factorization.
21012333104425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64653332652 (or 64653332647 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 21012333104425 its reverse (52440133321012), we get a palindrome (73452466425437).
The spelling of 21012333104425 in words is "twenty-one trillion, twelve billion, three hundred thirty-three million, one hundred four thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •