Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …111001111001011111101 |
3 | 10220011022121220202121222 |
4 | 100000131233033023331 |
5 | 121010310200100023 |
6 | 2201200551403125 |
7 | 142321200254414 |
oct | 20003557171375 |
9 | 3804277822558 |
10 | 1100010550013 |
11 | 39456a307411 |
12 | 1592333834a5 |
13 | 7c96603029b |
14 | 3b352a5247b |
15 | 1d931886cc8 |
hex | 1001dbcf2fd |
1100010550013 has 8 divisors (see below), whose sum is σ = 1104307127040. Its totient is φ = 1095721506000.
The previous prime is 1100010549991. The next prime is 1100010550043. The reversal of 1100010550013 is 3100550100011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1100010550013 - 224 = 1099993772797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1100010549973 and 1100010550000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100010550043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1590545 + ... + 2174822.
It is an arithmetic number, because the mean of its divisors is an integer number (138038390880).
Almost surely, 21100010550013 is an apocalyptic number.
It is an amenable number.
1100010550013 is a deficient number, since it is larger than the sum of its proper divisors (4296577027).
1100010550013 is an equidigital number, since it uses as much as digits as its factorization.
1100010550013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3766507.
The product of its (nonzero) digits is 75, while the sum is 17.
Adding to 1100010550013 its reverse (3100550100011), we get a palindrome (4200560650024).
The spelling of 1100010550013 in words is "one trillion, one hundred billion, ten million, five hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •