Base | Representation |
---|---|
bin | 1010010010001001001101… |
… | …10010000011111111100001 |
3 | 2222001211210101120121112121 |
4 | 11021010212302003333201 |
5 | 10431000230242034301 |
6 | 120032322522424241 |
7 | 4522532261664322 |
oct | 511044662037741 |
9 | 88054711517477 |
10 | 22613653471201 |
11 | 722943a936411 |
12 | 2652816962081 |
13 | c805c6075240 |
14 | 582714422449 |
15 | 2933766b43a1 |
hex | 149126c83fe1 |
22613653471201 has 16 divisors (see below), whose sum is σ = 24415027494480. Its totient is φ = 20821121740800.
The previous prime is 22613653471147. The next prime is 22613653471217. The reversal of 22613653471201 is 10217435631622.
It can be written as a sum of positive squares in 8 ways, for example, as 778135694400 + 21835517776801 = 882120^2 + 4672849^2 .
It is a cyclic number.
It is not a de Polignac number, because 22613653471201 - 217 = 22613653340129 is a prime.
It is a super-2 number, since 2×226136534712012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22613653471261) 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, 128115115 + ... + 128291503.
It is an arithmetic number, because the mean of its divisors is an integer number (1525939218405).
Almost surely, 222613653471201 is an apocalyptic number.
It is an amenable number.
22613653471201 is a deficient number, since it is larger than the sum of its proper divisors (1801374023279).
22613653471201 is a wasteful number, since it uses less digits than its factorization.
22613653471201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201396.
The product of its (nonzero) digits is 362880, while the sum is 43.
The spelling of 22613653471201 in words is "twenty-two trillion, six hundred thirteen billion, six hundred fifty-three million, four hundred seventy-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •