Base | Representation |
---|---|
bin | 100000100101011… |
… | …1001000001011000 |
3 | 2211012101011012211 |
4 | 1001022321001120 |
5 | 4214400432130 |
6 | 300254444504 |
7 | 36044345263 |
oct | 10112710130 |
9 | 2735334184 |
10 | 1093374040 |
11 | 5111aa110 |
12 | 266203734 |
13 | 1456a0ab5 |
14 | a52d5cda |
15 | 65ec7a2a |
hex | 412b9058 |
1093374040 has 64 divisors (see below), whose sum is σ = 2841622560. Its totient is φ = 374200320.
The previous prime is 1093374031. The next prime is 1093374049. The reversal of 1093374040 is 404733901.
It is an interprime number because it is at equal distance from previous prime (1093374031) and next prime (1093374049).
It is a junction number, because it is equal to n+sod(n) for n = 1093373993 and 1093374011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1093374049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65607 + ... + 80566.
Almost surely, 21093374040 is an apocalyptic number.
1093374040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1093374040 is an abundant number, since it is smaller than the sum of its proper divisors (1748248520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1093374040 is a wasteful number, since it uses less digits than its factorization.
1093374040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146212 (or 146208 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 31.
The square root of 1093374040 is about 33066.2069188469. The cubic root of 1093374040 is about 1030.2032589722.
The spelling of 1093374040 in words is "one billion, ninety-three million, three hundred seventy-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •