Base | Representation |
---|---|
bin | 100000110111010… |
… | …1101011111011000 |
3 | 2211212001012210211 |
4 | 1001232231133120 |
5 | 4224301421432 |
6 | 301232020504 |
7 | 36220224241 |
oct | 10156553730 |
9 | 2755035724 |
10 | 1102763992 |
11 | 516532a00 |
12 | 269391734 |
13 | 14760aa95 |
14 | a665bcc8 |
15 | 66c2ed47 |
hex | 41bad7d8 |
1102763992 has 48 divisors (see below), whose sum is σ = 2346120000. Its totient is φ = 485073600.
The previous prime is 1102763983. The next prime is 1102763999. The reversal of 1102763992 is 2993672011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102763999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11634 + ... + 48382.
It is an arithmetic number, because the mean of its divisors is an integer number (48877500).
Almost surely, 21102763992 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 1102763992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1173060000).
1102763992 is an abundant number, since it is smaller than the sum of its proper divisors (1243356008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102763992 is a wasteful number, since it uses less digits than its factorization.
1102763992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36808 (or 36793 counting only the distinct ones).
The product of its (nonzero) digits is 40824, while the sum is 40.
The square root of 1102763992 is about 33207.8905081307. The cubic root of 1102763992 is about 1033.1440025883.
The spelling of 1102763992 in words is "one billion, one hundred two million, seven hundred sixty-three thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •