Base | Representation |
---|---|
bin | 1011011000101101011… |
… | …0100101000000000000 |
3 | 200200220111111202220000 |
4 | 2312023112211000000 |
5 | 11201103014330224 |
6 | 225510200520000 |
7 | 20063302101150 |
oct | 2661326450000 |
9 | 620814452800 |
10 | 195611480064 |
11 | 75a5a643220 |
12 | 31ab1a80000 |
13 | 155a5078610 |
14 | 9679314760 |
15 | 514d0570c9 |
hex | 2d8b5a5000 |
195611480064 has 2080 divisors, whose sum is σ = 852514037760. Its totient is φ = 42998169600.
The previous prime is 195611480003. The next prime is 195611480093. The reversal of 195611480064 is 460084116591.
195611480064 is a `hidden beast` number, since 1 + 9 + 561 + 1 + 4 + 80 + 0 + 6 + 4 = 666.
It is a super-2 number, since 2×1956114800642 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 6310047729 + ... + 6310047759.
Almost surely, 2195611480064 is an apocalyptic number.
195611480064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 195611480064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (426257018880).
195611480064 is an abundant number, since it is smaller than the sum of its proper divisors (656902557696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195611480064 is a wasteful number, since it uses less digits than its factorization.
195611480064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117 (or 86 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 45.
The spelling of 195611480064 in words is "one hundred ninety-five billion, six hundred eleven million, four hundred eighty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •