Base | Representation |
---|---|
bin | 1011010010101011001… |
… | …1011111101011011111 |
3 | 200112201121112220220000 |
4 | 2310222303133223133 |
5 | 11134243331423440 |
6 | 225041334425343 |
7 | 20005202664240 |
oct | 2645263375337 |
9 | 615647486800 |
10 | 193991670495 |
11 | 752a9271327 |
12 | 3171b502253 |
13 | 153a75c800c |
14 | 9564144cc7 |
15 | 50a5c43730 |
hex | 2d2acdfadf |
193991670495 has 120 divisors (see below), whose sum is σ = 422181301344. Its totient is φ = 83464971264.
The previous prime is 193991670491. The next prime is 193991670503. The reversal of 193991670495 is 594076199391.
It is not a de Polignac number, because 193991670495 - 22 = 193991670491 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (193991670491) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 700929 + ... + 937701.
Almost surely, 2193991670495 is an apocalyptic number.
193991670495 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
193991670495 is an abundant number, since it is smaller than the sum of its proper divisors (228189630849).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
193991670495 is a wasteful number, since it uses less digits than its factorization.
193991670495 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236831 (or 236805 counting only the distinct ones).
The product of its (nonzero) digits is 16533720, while the sum is 63.
The spelling of 193991670495 in words is "one hundred ninety-three billion, nine hundred ninety-one million, six hundred seventy thousand, four hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •