Base | Representation |
---|---|
bin | 10000000001100110011… |
… | …011011101100111011000 |
3 | 10220021110121201110211010 |
4 | 100001212123131213120 |
5 | 121020304401244000 |
6 | 2201521554533520 |
7 | 142363336300446 |
oct | 20014633354730 |
9 | 3807417643733 |
10 | 1101230103000 |
11 | 395035758645 |
12 | 1595138972a0 |
13 | 7cacb8ac581 |
14 | 3b42a9d1b96 |
15 | 1d9a3985d50 |
hex | 100666dd9d8 |
1101230103000 has 128 divisors (see below), whose sum is σ = 3494073024000. Its totient is φ = 288684003200.
The previous prime is 1101230102989. The next prime is 1101230103079. The reversal of 1101230103000 is 3010321011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2933820 + ... + 3287819.
It is an arithmetic number, because the mean of its divisors is an integer number (27297445500).
Almost surely, 21101230103000 is an apocalyptic number.
1101230103000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101230103000 is an abundant number, since it is smaller than the sum of its proper divisors (2392842921000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101230103000 is a wasteful number, since it uses less digits than its factorization.
1101230103000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6221722 (or 6221708 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 1101230103000 its reverse (3010321011), we get a palindrome (1104240424011).
The spelling of 1101230103000 in words is "one trillion, one hundred one billion, two hundred thirty million, one hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •