Base | Representation |
---|---|
bin | 10000000101010000000… |
… | …110010000010011100000 |
3 | 10220122120211110210202202 |
4 | 100011100012100103200 |
5 | 121101322001141000 |
6 | 2203411000432332 |
7 | 142562441335655 |
oct | 20052006202340 |
9 | 3818524423682 |
10 | 1105150412000 |
11 | 396767661838 |
12 | 15a2287786a8 |
13 | 802a4b4b43b |
14 | 3b6bd51dc2c |
15 | 1db32c18dd5 |
hex | 101501904e0 |
1105150412000 has 48 divisors (see below), whose sum is σ = 2715354572112. Its totient is φ = 442060163200.
The previous prime is 1105150411979. The next prime is 1105150412081. The reversal of 1105150412000 is 2140515011.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138139802 + ... + 138147801.
It is an arithmetic number, because the mean of its divisors is an integer number (56569886919).
Almost surely, 21105150412000 is an apocalyptic number.
1105150412000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1105150412000 is an abundant number, since it is smaller than the sum of its proper divisors (1610204160112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1105150412000 is an equidigital number, since it uses as much as digits as its factorization.
1105150412000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276287628 (or 276287610 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 20.
Adding to 1105150412000 its reverse (2140515011), we get a palindrome (1107290927011).
The spelling of 1105150412000 in words is "one trillion, one hundred five billion, one hundred fifty million, four hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •