Base | Representation |
---|---|
bin | 100010011100111… |
… | …1000001101000100 |
3 | 2222120021001120200 |
4 | 1010321320031010 |
5 | 4331420214413 |
6 | 310413330500 |
7 | 40435014522 |
oct | 10471701504 |
9 | 2876231520 |
10 | 1156023108 |
11 | 5435aa2a9 |
12 | 283196a30 |
13 | 155667756 |
14 | ad763312 |
15 | 6b750573 |
hex | 44e78344 |
1156023108 has 144 divisors (see below), whose sum is σ = 3116305920. Its totient is φ = 360806400.
The previous prime is 1156023097. The next prime is 1156023133. The reversal of 1156023108 is 8013206511.
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, 6386778 + ... + 6386958.
Almost surely, 21156023108 is an apocalyptic number.
1156023108 is a gapful number since it is divisible by the number (18) 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 1156023108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1558152960).
1156023108 is an abundant number, since it is smaller than the sum of its proper divisors (1960282812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1156023108 is a wasteful number, since it uses less digits than its factorization.
1156023108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378 (or 373 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 1156023108 is about 34000.3398218312. The cubic root of 1156023108 is about 1049.5154553426.
Adding to 1156023108 its reverse (8013206511), we get a palindrome (9169229619).
The spelling of 1156023108 in words is "one billion, one hundred fifty-six million, twenty-three thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •