Base | Representation |
---|---|
bin | 1100001011101… |
… | …00111111000000 |
3 | 21010021211202100 |
4 | 12011310333000 |
5 | 202130103130 |
6 | 14050150400 |
7 | 2350416030 |
oct | 605647700 |
9 | 233254670 |
10 | 102191040 |
11 | 52758706 |
12 | 2a282400 |
13 | 1822cb93 |
14 | d8018c0 |
15 | 8e88c60 |
hex | 6174fc0 |
102191040 has 336 divisors, whose sum is σ = 415576512. Its totient is φ = 22560768.
The previous prime is 102191027. The next prime is 102191051. The reversal of 102191040 is 40191201.
It is a tau number, because it is divible by the number of its divisors (336).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 745852 + ... + 745988.
Almost surely, 2102191040 is an apocalyptic number.
102191040 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 102191040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (207788256).
102191040 is an abundant number, since it is smaller than the sum of its proper divisors (313385472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102191040 is a wasteful number, since it uses less digits than its factorization.
102191040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204 (or 191 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The square root of 102191040 is about 10108.9584033173. The cubic root of 102191040 is about 467.5243908080.
The spelling of 102191040 in words is "one hundred two million, one hundred ninety-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •