Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …101101000001000000100 |
3 | 10220021101121112122112120 |
4 | 100001210231220020010 |
5 | 121020230013411322 |
6 | 2201515045445540 |
7 | 142362536460453 |
oct | 20014455501004 |
9 | 3807347478476 |
10 | 1101201310212 |
11 | 395020482153 |
12 | 1595061108b0 |
13 | 7cac593ac13 |
14 | 3b426c58b9a |
15 | 1d9a1199a5c |
hex | 10064b68204 |
1101201310212 has 48 divisors (see below), whose sum is σ = 2573220619200. Its totient is φ = 366531443712.
The previous prime is 1101201310207. The next prime is 1101201310229. The reversal of 1101201310212 is 2120131021011.
It is a super-2 number, since 2×11012013102122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101201310191 and 1101201310200.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83563368 + ... + 83576544.
It is an arithmetic number, because the mean of its divisors is an integer number (53608762900).
Almost surely, 21101201310212 is an apocalyptic number.
1101201310212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1101201310212 is an abundant number, since it is smaller than the sum of its proper divisors (1472019308988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101201310212 is a wasteful number, since it uses less digits than its factorization.
1101201310212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22820 (or 22818 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1101201310212 its reverse (2120131021011), we get a palindrome (3221332331223).
The spelling of 1101201310212 in words is "one trillion, one hundred one billion, two hundred one million, three hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •