Base | Representation |
---|---|
bin | 10110111111011000000100… |
… | …110101000011111011010100 |
3 | 111021000020021010220110002112 |
4 | 112333120010311003323110 |
5 | 101223110241440213022 |
6 | 555014145352130152 |
7 | 30204054413414663 |
oct | 2677300465037324 |
9 | 437006233813075 |
10 | 101112201101012 |
11 | 2a243497593a22 |
12 | b41027b696958 |
13 | 4455abb9371ca |
14 | 1ad7bdc8c4dda |
15 | ba52614b68e2 |
hex | 5bf604d43ed4 |
101112201101012 has 6 divisors (see below), whose sum is σ = 176946351926778. Its totient is φ = 50556100550504.
The previous prime is 101112201100997. The next prime is 101112201101111. The reversal of 101112201101012 is 210101102211101.
It can be written as a sum of positive squares in only one way, i.e., 99651424293136 + 1460776807876 = 9982556^2 + 1208626^2 .
It is a super-3 number, since 3×1011122011010123 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12639025137623 + ... + 12639025137630.
It is an arithmetic number, because the mean of its divisors is an integer number (29491058654463).
Almost surely, 2101112201101012 is an apocalyptic number.
It is an amenable number.
101112201101012 is a deficient number, since it is larger than the sum of its proper divisors (75834150825766).
101112201101012 is a wasteful number, since it uses less digits than its factorization.
101112201101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25278050275257 (or 25278050275255 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101112201101012 its reverse (210101102211101), we get a palindrome (311213303312113).
The spelling of 101112201101012 in words is "one hundred one trillion, one hundred twelve billion, two hundred one million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •