Base | Representation |
---|---|
bin | 10000001011101110011… |
… | …000101110001000110100 |
3 | 10221022112020021021202112 |
4 | 100023232120232020310 |
5 | 121210040330121322 |
6 | 2210520412230152 |
7 | 143226620462600 |
oct | 20135630561064 |
9 | 3838466237675 |
10 | 1112101020212 |
11 | 399704040646 |
12 | 15b64846b358 |
13 | 80b41b4ca70 |
14 | 3bb7c6a0500 |
15 | 1dddd0285e2 |
hex | 102ee62e234 |
1112101020212 has 36 divisors (see below), whose sum is σ = 2438067626820. Its totient is φ = 439952050944.
The previous prime is 1112101020211. The next prime is 1112101020263. The reversal of 1112101020212 is 2120201012111.
It can be written as a sum of positive squares in 2 ways, for example, as 748110824356 + 363990195856 = 864934^2 + 603316^2 .
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112101020211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 218227637 + ... + 218232732.
It is an arithmetic number, because the mean of its divisors is an integer number (67724100745).
Almost surely, 21112101020212 is an apocalyptic number.
It is an amenable number.
1112101020212 is an abundant number, since it is smaller than the sum of its proper divisors (1325966606608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112101020212 is a wasteful number, since it uses less digits than its factorization.
1112101020212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 436460400 (or 436460391 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1112101020212 its reverse (2120201012111), we get a palindrome (3232302032323).
The spelling of 1112101020212 in words is "one trillion, one hundred twelve billion, one hundred one million, twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •