Base | Representation |
---|---|
bin | 1001110100111100001011… |
… | …11100001110010000110000 |
3 | 2211111220202220211001202101 |
4 | 10322132011330032100300 |
5 | 10313030221232413320 |
6 | 113543333532230144 |
7 | 4360200405003454 |
oct | 472360574162060 |
9 | 84456686731671 |
10 | 21610227622960 |
11 | 698193412aa89 |
12 | 251025960b354 |
13 | c09ab3103582 |
14 | 549d25000664 |
15 | 2771e92dbc0a |
hex | 13a785f0e430 |
21610227622960 has 20 divisors (see below), whose sum is σ = 50243779223568. Its totient is φ = 8644091049152.
The previous prime is 21610227622931. The next prime is 21610227622993. The reversal of 21610227622960 is 6922672201612.
It is a tau number, because it is divible by the number of its divisors (20).
It is a super-2 number, since 2×216102276229602 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21610227622960.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135063922564 + ... + 135063922723.
Almost surely, 221610227622960 is an apocalyptic number.
21610227622960 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21610227622960 is an abundant number, since it is smaller than the sum of its proper divisors (28633551600608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21610227622960 is a wasteful number, since it uses less digits than its factorization.
21610227622960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270127845300 (or 270127845294 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 46.
The spelling of 21610227622960 in words is "twenty-one trillion, six hundred ten billion, two hundred twenty-seven million, six hundred twenty-two thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •