Base | Representation |
---|---|
bin | 100010100111001… |
… | …1111010010110000 |
3 | 2222221102120002100 |
4 | 1011032133102300 |
5 | 4334311113341 |
6 | 311125220400 |
7 | 40531646625 |
oct | 10516372260 |
9 | 2887376070 |
10 | 1161426096 |
11 | 54665a686 |
12 | 284b61700 |
13 | 156809a9c |
14 | b036c34c |
15 | 6be6b3b6 |
hex | 4539f4b0 |
1161426096 has 30 divisors (see below), whose sum is σ = 3250380380. Its totient is φ = 387141984.
The previous prime is 1161426089. The next prime is 1161426103. The reversal of 1161426096 is 6906241611.
1161426096 is a `hidden beast` number, since 1 + 1 + 6 + 1 + 42 + 609 + 6 = 666.
It is an interprime number because it is at equal distance from previous prime (1161426089) and next prime (1161426103).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 1161426096.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4032586 + ... + 4032873.
Almost surely, 21161426096 is an apocalyptic number.
1161426096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1161426096 is an abundant number, since it is smaller than the sum of its proper divisors (2088954284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1161426096 is a wasteful number, since it uses less digits than its factorization.
1161426096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8065473 (or 8065464 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 1161426096 is about 34079.7021113742. The cubic root of 1161426096 is about 1051.1479798142.
The spelling of 1161426096 in words is "one billion, one hundred sixty-one million, four hundred twenty-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •