Base | Representation |
---|---|
bin | 100000100000101… |
… | …1111001000000000 |
3 | 2211000201220100220 |
4 | 1001001133020000 |
5 | 4213233034142 |
6 | 300125543040 |
7 | 36014366520 |
oct | 10101371000 |
9 | 2730656326 |
10 | 1090908672 |
11 | 50a875917 |
12 | 265414a80 |
13 | 1450198b9 |
14 | a4c53680 |
15 | 65b8c2ec |
hex | 4105f200 |
1090908672 has 160 divisors (see below), whose sum is σ = 3343131264. Its totient is φ = 309657600.
The previous prime is 1090908661. The next prime is 1090908697. The reversal of 1090908672 is 2768090901.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (42).
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, 2591022 + ... + 2591442.
Almost surely, 21090908672 is an apocalyptic number.
1090908672 is a gapful number since it is divisible by the number (12) 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 1090908672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1671565632).
1090908672 is an abundant number, since it is smaller than the sum of its proper divisors (2252222592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1090908672 is an equidigital number, since it uses as much as digits as its factorization.
1090908672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690 (or 674 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 42.
The square root of 1090908672 is about 33028.9066122389. The cubic root of 1090908672 is about 1029.4283666333.
The spelling of 1090908672 in words is "one billion, ninety million, nine hundred eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •