Base | Representation |
---|---|
bin | 1001110101101100001100… |
… | …11111001110001000011101 |
3 | 2211121101022111111211212220 |
4 | 10322312012133032020131 |
5 | 10313441020142214440 |
6 | 114003235541215553 |
7 | 4362102261465531 |
oct | 472660637161035 |
9 | 84541274454786 |
10 | 21636006601245 |
11 | 6991862749a13 |
12 | 2515252a015b9 |
13 | c0c360b3c48a |
14 | 54b28c9ddbc1 |
15 | 277c075828d0 |
hex | 13ad867ce21d |
21636006601245 has 64 divisors (see below), whose sum is σ = 35551911757824. Its totient is φ = 11229756814080.
The previous prime is 21636006601243. The next prime is 21636006601283. The reversal of 21636006601245 is 54210660063612.
It is not a de Polignac number, because 21636006601245 - 21 = 21636006601243 is a prime.
It is a super-3 number, since 3×216360066012453 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21636006601197 and 21636006601206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21636006601243) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 542739184 + ... + 542779046.
It is an arithmetic number, because the mean of its divisors is an integer number (555498621216).
Almost surely, 221636006601245 is an apocalyptic number.
It is an amenable number.
21636006601245 is a deficient number, since it is larger than the sum of its proper divisors (13915905156579).
21636006601245 is a wasteful number, since it uses less digits than its factorization.
21636006601245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42962.
The product of its (nonzero) digits is 311040, while the sum is 42.
Adding to 21636006601245 its reverse (54210660063612), we get a palindrome (75846666664857).
The spelling of 21636006601245 in words is "twenty-one trillion, six hundred thirty-six billion, six million, six hundred one thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •