Base | Representation |
---|---|
bin | 10000000000100100011… |
… | …100101010110101001101 |
3 | 10220011121110202001202122 |
4 | 100000210130222311031 |
5 | 121011023004414041 |
6 | 2201220052302325 |
7 | 142324035153536 |
oct | 20004434526515 |
9 | 3804543661678 |
10 | 1100123123021 |
11 | 39461790615a |
12 | 1592650119a5 |
13 | 7c983456830 |
14 | 3b36399768d |
15 | 1d93b6c1c4b |
hex | 1002472ad4d |
1100123123021 has 8 divisors (see below), whose sum is σ = 1207101714840. Its totient is φ = 996337922112.
The previous prime is 1100123123003. The next prime is 1100123123027. The reversal of 1100123123021 is 1203213210011.
It can be written as a sum of positive squares in 4 ways, for example, as 294212947396 + 805910175625 = 542414^2 + 897725^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100123123021 - 230 = 1099049381197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100123123027) 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, 798347006 + ... + 798348383.
It is an arithmetic number, because the mean of its divisors is an integer number (150887714355).
Almost surely, 21100123123021 is an apocalyptic number.
It is an amenable number.
1100123123021 is a deficient number, since it is larger than the sum of its proper divisors (106978591819).
1100123123021 is a wasteful number, since it uses less digits than its factorization.
1100123123021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1596695455.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1100123123021 its reverse (1203213210011), we get a palindrome (2303336333032).
The spelling of 1100123123021 in words is "one trillion, one hundred billion, one hundred twenty-three million, one hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •