Base | Representation |
---|---|
bin | 1011100110010001111… |
… | …0010100111000000000 |
3 | 201001022100212110000110 |
4 | 2321210132110320000 |
5 | 11231033031321130 |
6 | 231311444151320 |
7 | 20252463321615 |
oct | 2714436247000 |
9 | 631270773013 |
10 | 199254167040 |
11 | 77559867925 |
12 | 32749998540 |
13 | 15a359532b6 |
14 | 990301650c |
15 | 52b2c4bab0 |
hex | 2e64794e00 |
199254167040 has 160 divisors (see below), whose sum is σ = 639046526976. Its totient is φ = 52962959360.
The previous prime is 199254167033. The next prime is 199254167117. The reversal of 199254167040 is 40761452991.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (160).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2346769 + ... + 2430191.
Almost surely, 2199254167040 is an apocalyptic number.
199254167040 is a gapful number since it is divisible by the number (10) 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 199254167040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (319523263488).
199254167040 is an abundant number, since it is smaller than the sum of its proper divisors (439792359936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
199254167040 is an equidigital number, since it uses as much as digits as its factorization.
199254167040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83760 (or 83744 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 48.
The spelling of 199254167040 in words is "one hundred ninety-nine billion, two hundred fifty-four million, one hundred sixty-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •