Base | Representation |
---|---|
bin | 10000000001101010101… |
… | …101110001010010000100 |
3 | 10220021122122000210001211 |
4 | 100001222231301102010 |
5 | 121020431303323022 |
6 | 2201533044101204 |
7 | 142365201432010 |
oct | 20015255612204 |
9 | 3807578023054 |
10 | 1101302011012 |
11 | 395072302155 |
12 | 159533994804 |
13 | 7cb107686a8 |
14 | 3b43638d540 |
15 | 1d9a9e3be77 |
hex | 1006ab71484 |
1101302011012 has 48 divisors (see below), whose sum is σ = 2339526284928. Its totient is φ = 442821265920.
The previous prime is 1101302010983. The next prime is 1101302011037. The reversal of 1101302011012 is 2101102031011.
It is a happy number.
It is a super-2 number, since 2×11013020110122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101302010983 and 1101302011001.
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, 3498414 + ... + 3800197.
It is an arithmetic number, because the mean of its divisors is an integer number (48740130936).
Almost surely, 21101302011012 is an apocalyptic number.
It is an amenable number.
1101302011012 is an abundant number, since it is smaller than the sum of its proper divisors (1238224273916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101302011012 is a wasteful number, since it uses less digits than its factorization.
1101302011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7298956 (or 7298954 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1101302011012 its reverse (2101102031011), we get a palindrome (3202404042023).
The spelling of 1101302011012 in words is "one trillion, one hundred one billion, three hundred two million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •