Base | Representation |
---|---|
bin | 10111000000100… |
… | …11010010101110 |
3 | 111110012021120000 |
4 | 23200103102232 |
5 | 343403021011 |
6 | 31053005130 |
7 | 4532421540 |
oct | 1340232256 |
9 | 443167500 |
10 | 193017006 |
11 | 99a53596 |
12 | 547837a6 |
13 | 30cb0a60 |
14 | 1b8c5690 |
15 | 11e2a356 |
hex | b8134ae |
193017006 has 80 divisors (see below), whose sum is σ = 532349664. Its totient is φ = 50901696.
The previous prime is 193016983. The next prime is 193017007. The reversal of 193017006 is 600710391.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (193017007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 8196 + ... + 21288.
Almost surely, 2193017006 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 193017006, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (266174832).
193017006 is an abundant number, since it is smaller than the sum of its proper divisors (339332658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
193017006 is a wasteful number, since it uses less digits than its factorization.
193017006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13127 (or 13118 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 27.
The square root of 193017006 is about 13893.0560353005. The cubic root of 193017006 is about 577.9166296981.
Adding to 193017006 its reverse (600710391), we get a palindrome (793727397).
The spelling of 193017006 in words is "one hundred ninety-three million, seventeen thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •