Base | Representation |
---|---|
bin | 1011011001100110111… |
… | …0010101010110001100 |
3 | 200201112022012100101102 |
4 | 2312121232111112030 |
5 | 11202101230312203 |
6 | 225550132402232 |
7 | 20102260351040 |
oct | 2663156252614 |
9 | 621468170342 |
10 | 195852588428 |
11 | 76073753532 |
12 | 31b5a776378 |
13 | 15612cc6aa3 |
14 | 969d358020 |
15 | 51642d1888 |
hex | 2d99b9558c |
195852588428 has 48 divisors (see below), whose sum is σ = 406180051200. Its totient is φ = 80848891200.
The previous prime is 195852588419. The next prime is 195852588493. The reversal of 195852588428 is 824885258591.
It is a super-2 number, since 2×1958525884282 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (65) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52403 + ... + 628053.
It is an arithmetic number, because the mean of its divisors is an integer number (8462084400).
Almost surely, 2195852588428 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 195852588428, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203090025600).
195852588428 is an abundant number, since it is smaller than the sum of its proper divisors (210327462772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195852588428 is a wasteful number, since it uses less digits than its factorization.
195852588428 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 576110 (or 576108 counting only the distinct ones).
The product of its digits is 73728000, while the sum is 65.
The spelling of 195852588428 in words is "one hundred ninety-five billion, eight hundred fifty-two million, five hundred eighty-eight thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •