Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …110001010110001011100 |
3 | 10220021101121210212012120 |
4 | 100001210232022301130 |
5 | 121020230032431444 |
6 | 2201515052502540 |
7 | 142362540621264 |
oct | 20014456126134 |
9 | 3807347725176 |
10 | 1101201452124 |
11 | 395020569834 |
12 | 15950617aa50 |
13 | 7cac598a6a7 |
14 | 3b426c947a4 |
15 | 1d9a11c6b19 |
hex | 10064b8ac5c |
1101201452124 has 48 divisors (see below), whose sum is σ = 2574766565280. Its totient is φ = 366311292160.
The previous prime is 1101201452107. The next prime is 1101201452129. The reversal of 1101201452124 is 4212541021011.
It is a super-2 number, since 2×11012014521242 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101201452094 and 1101201452103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101201452129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11390662 + ... + 11486930.
It is an arithmetic number, because the mean of its divisors is an integer number (53640970110).
Almost surely, 21101201452124 is an apocalyptic number.
It is an amenable number.
1101201452124 is an abundant number, since it is smaller than the sum of its proper divisors (1473565113156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101201452124 is a wasteful number, since it uses less digits than its factorization.
1101201452124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98230 (or 98228 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 24.
Adding to 1101201452124 its reverse (4212541021011), we get a palindrome (5313742473135).
The spelling of 1101201452124 in words is "one trillion, one hundred one billion, two hundred one million, four hundred fifty-two thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •