Base | Representation |
---|---|
bin | 11000000010011100111111… |
… | …010001111111011101111000 |
3 | 111212022220010202211010001210 |
4 | 120002130333101333131320 |
5 | 102324121001002001211 |
6 | 1012503511534043120 |
7 | 31161065553664002 |
oct | 3002347721773570 |
9 | 455286122733053 |
10 | 105721681672056 |
11 | 3076034a16646a |
12 | ba356a13494a0 |
13 | 46cb686581c98 |
14 | 1c16d57259372 |
15 | c350e47979a6 |
hex | 60273f47f778 |
105721681672056 has 16 divisors (see below), whose sum is σ = 264304204180200. Its totient is φ = 35240560557344.
The previous prime is 105721681672043. The next prime is 105721681672081. The reversal of 105721681672056 is 650276186127501.
It is a happy number.
105721681672056 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1057216816720562 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105721681671987 and 105721681672005.
It is a congruent number.
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, 2202535034811 + ... + 2202535034858.
Almost surely, 2105721681672056 is an apocalyptic number.
It is an amenable number.
105721681672056 is an abundant number, since it is smaller than the sum of its proper divisors (158582522508144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105721681672056 is a wasteful number, since it uses less digits than its factorization.
105721681672056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4405070069678 (or 4405070069674 counting only the distinct ones).
The product of its (nonzero) digits is 8467200, while the sum is 57.
The spelling of 105721681672056 in words is "one hundred five trillion, seven hundred twenty-one billion, six hundred eighty-one million, six hundred seventy-two thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •