Base | Representation |
---|---|
bin | 1001110110010001001000… |
… | …11011101111111110100100 |
3 | 2211200021111110200222220000 |
4 | 10323020210123233332210 |
5 | 10314302123102014422 |
6 | 114020315345541300 |
7 | 4363403545612206 |
oct | 473104433577644 |
9 | 84607443628800 |
10 | 21655836360612 |
11 | 699a2090716a3 |
12 | 2519067944830 |
13 | c111a117c3bc |
14 | 54c21044c776 |
15 | 2784b83c1cac |
hex | 13b2246effa4 |
21655836360612 has 30 divisors (see below), whose sum is σ = 56612633943558. Its totient is φ = 7218612120096.
The previous prime is 21655836360593. The next prime is 21655836360679. The reversal of 21655836360612 is 21606363855612.
21655836360612 is a `hidden beast` number, since 2 + 16 + 5 + 5 + 8 + 3 + 6 + 3 + 6 + 0 + 612 = 666.
It can be written as a sum of positive squares in only one way, i.e., 20242224746496 + 1413611614116 = 4499136^2 + 1188954^2 .
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 33419500233 + ... + 33419500880.
Almost surely, 221655836360612 is an apocalyptic number.
It is an amenable number.
21655836360612 is an abundant number, since it is smaller than the sum of its proper divisors (34956797582946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21655836360612 is a wasteful number, since it uses less digits than its factorization.
21655836360612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66839001129 (or 66839001118 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 54.
The spelling of 21655836360612 in words is "twenty-one trillion, six hundred fifty-five billion, eight hundred thirty-six million, three hundred sixty thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •