Base | Representation |
---|---|
bin | 11101011101001101000… |
… | …01110101001101001101 |
3 | 10120202102202210012001210 |
4 | 32232212201311031031 |
5 | 113040300431413401 |
6 | 2052542451325033 |
7 | 133060026156150 |
oct | 16564641651515 |
9 | 3522382705053 |
10 | 1012111201101 |
11 | 360263429600 |
12 | 1441a1bb0779 |
13 | 74598496320 |
14 | 36db4b2dc97 |
15 | 1b4d9b504d6 |
hex | eba687534d |
1012111201101 has 96 divisors (see below), whose sum is σ = 1832131494144. Its totient is φ = 483596467200.
The previous prime is 1012111201027. The next prime is 1012111201103. The reversal of 1012111201101 is 1011021112101.
It is not a de Polignac number, because 1012111201101 - 210 = 1012111200077 is a prime.
It is a super-2 number, since 2×10121112011012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012111201103) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 9227755 + ... + 9336791.
It is an arithmetic number, because the mean of its divisors is an integer number (19084703064).
Almost surely, 21012111201101 is an apocalyptic number.
1012111201101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012111201101 is a deficient number, since it is larger than the sum of its proper divisors (820020293043).
1012111201101 is a wasteful number, since it uses less digits than its factorization.
1012111201101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109363 (or 109352 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1012111201101 its reverse (1011021112101), we get a palindrome (2023132313202).
The spelling of 1012111201101 in words is "one trillion, twelve billion, one hundred eleven million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •