Base | Representation |
---|---|
bin | 10000110100110101100… |
… | …001000001100010100100 |
3 | 11002112110122011122121200 |
4 | 100310311201001202210 |
5 | 122420441434132012 |
6 | 2243100550442500 |
7 | 146351543165631 |
oct | 20646541014244 |
9 | 4075418148550 |
10 | 1156244052132 |
11 | 4063a6695904 |
12 | 168107963430 |
13 | 850583530b0 |
14 | 3dd691b5188 |
15 | 201235da3dc |
hex | 10d358418a4 |
1156244052132 has 72 divisors (see below), whose sum is σ = 3151931852160. Its totient is φ = 355272488640.
The previous prime is 1156244052079. The next prime is 1156244052143. The reversal of 1156244052132 is 2312504426511.
1156244052132 is a `hidden beast` number, since 1 + 1 + 5 + 62 + 4 + 40 + 521 + 32 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1381594 + ... + 2054577.
It is an arithmetic number, because the mean of its divisors is an integer number (43776831280).
Almost surely, 21156244052132 is an apocalyptic number.
1156244052132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1156244052132 is an abundant number, since it is smaller than the sum of its proper divisors (1995687800028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1156244052132 is a wasteful number, since it uses less digits than its factorization.
1156244052132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3436913 (or 3436908 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
Adding to 1156244052132 its reverse (2312504426511), we get a palindrome (3468748478643).
The spelling of 1156244052132 in words is "one trillion, one hundred fifty-six billion, two hundred forty-four million, fifty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •