Base | Representation |
---|---|
bin | 101100010101101100101101… |
… | …010101001010111111100000 |
3 | 221120110022101221012212202001 |
4 | 230111230231111022333200 |
5 | 201024431032112240211 |
6 | 1530424044543533344 |
7 | 56034441445426150 |
oct | 5425545525127740 |
9 | 846408357185661 |
10 | 195005160665056 |
11 | 5715325146a935 |
12 | 19a553818ba254 |
13 | 84a6ba541a8a1 |
14 | 362242b802760 |
15 | 17827e995dac1 |
hex | b15b2d54afe0 |
195005160665056 has 48 divisors (see below), whose sum is σ = 438762964479840. Its totient is φ = 83573382574080.
The previous prime is 195005160665033. The next prime is 195005160665057. The reversal of 195005160665056 is 650566061500591.
It is a junction number, because it is equal to n+sod(n) for n = 195005160664988 and 195005160665006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195005160665057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83368116 + ... + 85675276.
It is an arithmetic number, because the mean of its divisors is an integer number (9140895093330).
Almost surely, 2195005160665056 is an apocalyptic number.
195005160665056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
195005160665056 is an abundant number, since it is smaller than the sum of its proper divisors (243757803814784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195005160665056 is a wasteful number, since it uses less digits than its factorization.
195005160665056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2684507 (or 2684499 counting only the distinct ones).
The product of its (nonzero) digits is 7290000, while the sum is 55.
The spelling of 195005160665056 in words is "one hundred ninety-five trillion, five billion, one hundred sixty million, six hundred sixty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •