Base | Representation |
---|---|
bin | 1011001110110001101… |
… | …1111000101100011100 |
3 | 200110000200121111100000 |
4 | 2303230123320230130 |
5 | 11130122443402413 |
6 | 224345435134300 |
7 | 16640235640230 |
oct | 2635433705434 |
9 | 613020544300 |
10 | 192945294108 |
11 | 74911652256 |
12 | 31488ba4390 |
13 | 1526b8a0ba8 |
14 | 94a51a45c0 |
15 | 5043e51073 |
hex | 2cec6f8b1c |
192945294108 has 144 divisors (see below), whose sum is σ = 578259019520. Its totient is φ = 55106521344.
The previous prime is 192945294089. The next prime is 192945294119. The reversal of 192945294108 is 801492549291.
192945294108 is a `hidden beast` number, since 1 + 9 + 2 + 9 + 4 + 529 + 4 + 108 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35602623 + ... + 35608041.
Almost surely, 2192945294108 is an apocalyptic number.
192945294108 is a gapful number since it is divisible by the number (18) 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 192945294108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (289129509760).
192945294108 is an abundant number, since it is smaller than the sum of its proper divisors (385313725412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
192945294108 is a wasteful number, since it uses less digits than its factorization.
192945294108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10678 (or 10664 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 54.
The spelling of 192945294108 in words is "one hundred ninety-two billion, nine hundred forty-five million, two hundred ninety-four thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •