Base | Representation |
---|---|
bin | 1100110101111101… |
… | …00000111000000100 |
3 | 122210112020122011120 |
4 | 12122332200320010 |
5 | 103110112434043 |
6 | 3100104433540 |
7 | 332602632234 |
oct | 63276407004 |
9 | 18715218146 |
10 | 6895046148 |
11 | 2a1908a251 |
12 | 14051788b0 |
13 | 85b649683 |
14 | 495a39cc4 |
15 | 2a54d6983 |
hex | 19afa0e04 |
6895046148 has 72 divisors (see below), whose sum is σ = 16787333472. Its totient is φ = 2202455808.
The previous prime is 6895046141. The next prime is 6895046159. The reversal of 6895046148 is 8416405986.
It is a super-2 number, since 2×68950461482 = 95083322766099275808, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6895046148.
It is not an unprimeable number, because it can be changed into a prime (6895046141) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1380111 + ... + 1385097.
Almost surely, 26895046148 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6895046148, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8393666736).
6895046148 is an abundant number, since it is smaller than the sum of its proper divisors (9892287324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6895046148 is a wasteful number, since it uses less digits than its factorization.
6895046148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5189 (or 5158 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 51.
The square root of 6895046148 is about 83036.4145902266. The cubic root of 6895046148 is about 1903.3225472940.
The spelling of 6895046148 in words is "six billion, eight hundred ninety-five million, forty-six thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •