Base | Representation |
---|---|
bin | 11100111111111100011… |
… | …111110110110111010100 |
3 | 21001111210002012020000212 |
4 | 130333330133312313110 |
5 | 230122231323131133 |
6 | 4123252114024552 |
7 | 263655410042303 |
oct | 34777437666724 |
9 | 7044702166025 |
10 | 1992806067668 |
11 | 6a9165088a69 |
12 | 282276878158 |
13 | 115bc8019b90 |
14 | 6c64929043a |
15 | 36c86657148 |
hex | 1cffc7f6dd4 |
1992806067668 has 24 divisors (see below), whose sum is σ = 3797871555240. Its totient is φ = 909422300160.
The previous prime is 1992806067647. The next prime is 1992806067673. The reversal of 1992806067668 is 8667606082991.
It can be written as a sum of positive squares in 4 ways, for example, as 35638643524 + 1957167424144 = 188782^2 + 1398988^2 .
It is a Smith number, since the sum of its digits (68) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1992806067598 and 1992806067607.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 215294213 + ... + 215303468.
It is an arithmetic number, because the mean of its divisors is an integer number (158244648135).
Almost surely, 21992806067668 is an apocalyptic number.
It is an amenable number.
1992806067668 is a deficient number, since it is larger than the sum of its proper divisors (1805065487572).
1992806067668 is a wasteful number, since it uses less digits than its factorization.
1992806067668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430597787 (or 430597785 counting only the distinct ones).
The product of its (nonzero) digits is 94058496, while the sum is 68.
The spelling of 1992806067668 in words is "one trillion, nine hundred ninety-two billion, eight hundred six million, sixty-seven thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •