Base | Representation |
---|---|
bin | 1001000110101010100001… |
… | …1101001011001110010000 |
3 | 1022102221211002012102202100 |
4 | 2101222220131023032100 |
5 | 2303001141101120422 |
6 | 33142324303320400 |
7 | 2052130416164133 |
oct | 221525035131620 |
9 | 38387732172670 |
10 | 10010100020112 |
11 | 320a294553685 |
12 | 11580362b0100 |
13 | 577c4379569a |
14 | 2686c468a21a |
15 | 1255bb9ab7ac |
hex | 91aa874b390 |
10010100020112 has 120 divisors (see below), whose sum is σ = 28108989581400. Its totient is φ = 3325434937344.
The previous prime is 10010100020093. The next prime is 10010100020197. The reversal of 10010100020112 is 21102000101001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 891052929936 + 9119047090176 = 943956^2 + 3019776^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10010100020094 and 10010100020103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 296061064 + ... + 296094872.
It is an arithmetic number, because the mean of its divisors is an integer number (234241579845).
Almost surely, 210010100020112 is an apocalyptic number.
10010100020112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10010100020112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14054494790700).
10010100020112 is an abundant number, since it is smaller than the sum of its proper divisors (18098889561288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010100020112 is a wasteful number, since it uses less digits than its factorization.
10010100020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40705 (or 40696 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10010100020112 its reverse (21102000101001), we get a palindrome (31112100121113).
The spelling of 10010100020112 in words is "ten trillion, ten billion, one hundred million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •