Base | Representation |
---|---|
bin | 1010010101000011010000… |
… | …00010110101100011011100 |
3 | 2222102101121010211212011122 |
4 | 11022201220002311203130 |
5 | 10434114303323312411 |
6 | 120150241451510112 |
7 | 4532666340610613 |
oct | 512415002654334 |
9 | 88371533755148 |
10 | 22713532635356 |
11 | 7267834039782 |
12 | 266a050158338 |
13 | c89b52827484 |
14 | 5874ab3ca87a |
15 | 295c6eed09db |
hex | 14a8680b58dc |
22713532635356 has 6 divisors (see below), whose sum is σ = 39748682111880. Its totient is φ = 11356766317676.
The previous prime is 22713532635341. The next prime is 22713532635359. The reversal of 22713532635356 is 65353623531722.
It is a super-2 number, since 2×227135326353562 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22713532635298 and 22713532635307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22713532635359) 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 as a sum of consecutive naturals, namely, 2839191579416 + ... + 2839191579423.
It is an arithmetic number, because the mean of its divisors is an integer number (6624780351980).
Almost surely, 222713532635356 is an apocalyptic number.
It is an amenable number.
22713532635356 is a deficient number, since it is larger than the sum of its proper divisors (17035149476524).
22713532635356 is a wasteful number, since it uses less digits than its factorization.
22713532635356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5678383158843 (or 5678383158841 counting only the distinct ones).
The product of its digits is 20412000, while the sum is 53.
The spelling of 22713532635356 in words is "twenty-two trillion, seven hundred thirteen billion, five hundred thirty-two million, six hundred thirty-five thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •