Base | Representation |
---|---|
bin | 10000000001011101111… |
… | …001101111111011110100 |
3 | 10220021002122112111110000 |
4 | 100001131321233323310 |
5 | 121020011241004122 |
6 | 2201455444431300 |
7 | 142356651322662 |
oct | 20013571577364 |
9 | 3807078474400 |
10 | 1101087047412 |
11 | 394a71a29890 |
12 | 1594939a8530 |
13 | 7caa80724b1 |
14 | 3b4159d3c32 |
15 | 1d9961290ac |
hex | 1005de6fef4 |
1101087047412 has 120 divisors (see below), whose sum is σ = 3187005544800. Its totient is φ = 328682629440.
The previous prime is 1101087047407. The next prime is 1101087047429. The reversal of 1101087047412 is 2147407801011.
1101087047412 is a `hidden beast` number, since 1 + 1 + 0 + 108 + 70 + 474 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2066787 + ... + 2544362.
It is an arithmetic number, because the mean of its divisors is an integer number (26558379540).
Almost surely, 21101087047412 is an apocalyptic number.
1101087047412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1101087047412 is an abundant number, since it is smaller than the sum of its proper divisors (2085918497388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101087047412 is a wasteful number, since it uses less digits than its factorization.
1101087047412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4611243 (or 4611232 counting only the distinct ones).
The product of its (nonzero) digits is 12544, while the sum is 36.
The spelling of 1101087047412 in words is "one trillion, one hundred one billion, eighty-seven million, forty-seven thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •