Base | Representation |
---|---|
bin | 1001110100101100001000… |
… | …11000101111100111110100 |
3 | 2211111002112110021021202221 |
4 | 10322112010120233213310 |
5 | 10312410100033014422 |
6 | 113535350545212124 |
7 | 4356444034054105 |
oct | 472260430574764 |
9 | 84432473237687 |
10 | 21601611610612 |
11 | 6979212668420 |
12 | 250a654031044 |
13 | c0903c079507 |
14 | 5497489c23ac |
15 | 276d92bae3c7 |
hex | 13a58462f9f4 |
21601611610612 has 24 divisors (see below), whose sum is σ = 41239559071872. Its totient is φ = 9818886100800.
The previous prime is 21601611610583. The next prime is 21601611610639.
21601611610612 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×216016116106122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26646168 + ... + 27444880.
It is an arithmetic number, because the mean of its divisors is an integer number (1718314961328).
Almost surely, 221601611610612 is an apocalyptic number.
21601611610612 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21601611610612 is a deficient number, since it is larger than the sum of its proper divisors (19637947461260).
21601611610612 is a wasteful number, since it uses less digits than its factorization.
21601611610612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413399 (or 1413397 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 34.
It can be divided in two parts, 2160161 and 1610612, that added together give a palindrome (3770773).
The spelling of 21601611610612 in words is "twenty-one trillion, six hundred one billion, six hundred eleven million, six hundred ten thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •