Base | Representation |
---|---|
bin | 10000000101001101011… |
… | …101000010111101100100 |
3 | 10220122110202000020102100 |
4 | 100011031131002331210 |
5 | 121101224122230022 |
6 | 2203402334012100 |
7 | 142561362323211 |
oct | 20051535027544 |
9 | 3818422006370 |
10 | 1105106055012 |
11 | 396744615773 |
12 | 15a215947030 |
13 | 802988ba6bb |
14 | 3b6b7694b08 |
15 | 1db2dda61ac |
hex | 1014d742f64 |
1105106055012 has 72 divisors (see below), whose sum is σ = 2808436208760. Its totient is φ = 366398622720.
The previous prime is 1105106054999. The next prime is 1105106055013. The reversal of 1105106055012 is 2105506015011.
1105106055012 is a `hidden beast` number, since 1 + 1 + 0 + 5 + 1 + 0 + 605 + 50 + 1 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 13779003456 + 1091327051556 = 117384^2 + 1044666^2 .
It is not an unprimeable number, because it can be changed into a prime (1105106055013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5843212 + ... + 6029372.
It is an arithmetic number, because the mean of its divisors is an integer number (39006058455).
Almost surely, 21105106055012 is an apocalyptic number.
1105106055012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1105106055012 is an abundant number, since it is smaller than the sum of its proper divisors (1703330153748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1105106055012 is a wasteful number, since it uses less digits than its factorization.
1105106055012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187053 (or 187048 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 27.
The spelling of 1105106055012 in words is "one trillion, one hundred five billion, one hundred six million, fifty-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •