Base | Representation |
---|---|
bin | 1011010010100001100… |
… | …0010101001001000000 |
3 | 200112121210000101121111 |
4 | 2310220120111021000 |
5 | 11134202423320013 |
6 | 225033322533104 |
7 | 20004200153641 |
oct | 2645030251100 |
9 | 615553011544 |
10 | 193950995008 |
11 | 7528830a221 |
12 | 31709967194 |
13 | 1539c055b94 |
14 | 955c9976c8 |
15 | 50a23ab73d |
hex | 2d28615240 |
193950995008 has 224 divisors, whose sum is σ = 418025494656. Its totient is φ = 89125650432.
The previous prime is 193950994987. The next prime is 193950995047. The reversal of 193950995008 is 800599059391.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 447923560 + ... + 447923992.
It is an arithmetic number, because the mean of its divisors is an integer number (1866185244).
Almost surely, 2193950995008 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 193950995008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209012747328).
193950995008 is an abundant number, since it is smaller than the sum of its proper divisors (224074499648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
193950995008 is a wasteful number, since it uses less digits than its factorization.
193950995008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661 (or 651 counting only the distinct ones).
The product of its (nonzero) digits is 3936600, while the sum is 58.
The spelling of 193950995008 in words is "one hundred ninety-three billion, nine hundred fifty million, nine hundred ninety-five thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •