Base | Representation |
---|---|
bin | 10000000010010101100… |
… | …001001001001001110000 |
3 | 10220100111200021120001110 |
4 | 100002111201021021300 |
5 | 121023414122334300 |
6 | 2202132215433320 |
7 | 142422041321505 |
oct | 20022541111160 |
9 | 3810450246043 |
10 | 1102020121200 |
11 | 3954006a0a49 |
12 | 1596b4385840 |
13 | 7cbc6478c6b |
14 | 3b4a38bd4ac |
15 | 1d9eceda550 |
hex | 10095849270 |
1102020121200 has 120 divisors (see below), whose sum is σ = 3625547063728. Its totient is φ = 285929533440.
The previous prime is 1102020121193. The next prime is 1102020121249. The reversal of 1102020121200 is 21210202011.
It is a tau number, because it is divible by the number of its divisors (120).
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 (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12365737 + ... + 12454536.
Almost surely, 21102020121200 is an apocalyptic number.
1102020121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102020121200 is an abundant number, since it is smaller than the sum of its proper divisors (2523526942528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102020121200 is a wasteful number, since it uses less digits than its factorization.
1102020121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24820331 (or 24820320 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1102020121200 its reverse (21210202011), we get a palindrome (1123230323211).
The spelling of 1102020121200 in words is "one trillion, one hundred two billion, twenty million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •