Base | Representation |
---|---|
bin | 1001110001000011001000… |
… | …11111011110100100000101 |
3 | 2211001010122202221200210220 |
4 | 10320201210133132210011 |
5 | 10303332404222001003 |
6 | 113402102254334553 |
7 | 4344425150551200 |
oct | 470414437364405 |
9 | 84033582850726 |
10 | 21476522453253 |
11 | 693016204002a |
12 | 24aa363aba459 |
13 | bca2c571803a |
14 | 54367d80a937 |
15 | 2739c1040353 |
hex | 1388647de905 |
21476522453253 has 12 divisors (see below), whose sum is σ = 33310524621600. Its totient is φ = 12272298544632.
The previous prime is 21476522453167. The next prime is 21476522453257. The reversal of 21476522453253 is 35235422567412.
It is not a de Polignac number, because 21476522453253 - 29 = 21476522452741 is a prime.
It is a super-2 number, since 2×214765224532532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21476522453196 and 21476522453205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21476522453257) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 73049395953 + ... + 73049396246.
It is an arithmetic number, because the mean of its divisors is an integer number (2775877051800).
Almost surely, 221476522453253 is an apocalyptic number.
It is an amenable number.
21476522453253 is a deficient number, since it is larger than the sum of its proper divisors (11834002168347).
21476522453253 is a wasteful number, since it uses less digits than its factorization.
21476522453253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146098792216 (or 146098792209 counting only the distinct ones).
The product of its digits is 12096000, while the sum is 51.
The spelling of 21476522453253 in words is "twenty-one trillion, four hundred seventy-six billion, five hundred twenty-two million, four hundred fifty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •