Base | Representation |
---|---|
bin | 100000000100101101… |
… | …0011010100011100000 |
3 | 20120210011222020221210 |
4 | 1000021122122203200 |
5 | 2112030103134232 |
6 | 51350345350120 |
7 | 4655563131153 |
oct | 1001132324340 |
9 | 216704866853 |
10 | 68877396192 |
11 | 27235549230 |
12 | 11422a98340 |
13 | 66589b1347 |
14 | 34958b1c9a |
15 | 1bd1cb25cc |
hex | 100969a8e0 |
68877396192 has 96 divisors (see below), whose sum is σ = 199456266240. Its totient is φ = 20637393920.
The previous prime is 68877396179. The next prime is 68877396199. The reversal of 68877396192 is 29169377886.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×688773961922 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68877396199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 272448 + ... + 460415.
It is an arithmetic number, because the mean of its divisors is an integer number (2077669440).
Almost surely, 268877396192 is an apocalyptic number.
It is an amenable number.
68877396192 is an abundant number, since it is smaller than the sum of its proper divisors (130578870048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68877396192 is a wasteful number, since it uses less digits than its factorization.
68877396192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 732976 (or 732968 counting only the distinct ones).
The product of its digits is 54867456, while the sum is 66.
The spelling of 68877396192 in words is "sixty-eight billion, eight hundred seventy-seven million, three hundred ninety-six thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •