Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1100001111111000000 |
3 | 100122221222020211221202 |
4 | 1132022021201333000 |
5 | 3124024103031422 |
6 | 114240130440332 |
7 | 10206254560436 |
oct | 1361211417700 |
9 | 318858224852 |
10 | 101102002112 |
11 | 39971498651 |
12 | 17716a330a8 |
13 | 96c2c117b7 |
14 | 4c71560d56 |
15 | 296ad68b92 |
hex | 178a261fc0 |
101102002112 has 56 divisors (see below), whose sum is σ = 201358841376. Its totient is φ = 50366204928.
The previous prime is 101102002103. The next prime is 101102002121. The reversal of 101102002112 is 211200201101.
It is an interprime number because it is at equal distance from previous prime (101102002103) and next prime (101102002121).
It is a super-2 number, since 2×1011020021122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101102002093 and 101102002102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44090438 + ... + 44092730.
It is an arithmetic number, because the mean of its divisors is an integer number (3595693596).
Almost surely, 2101102002112 is an apocalyptic number.
It is an amenable number.
101102002112 is a deficient number, since it is larger than the sum of its proper divisors (100256839264).
101102002112 is a wasteful number, since it uses less digits than its factorization.
101102002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4525 (or 4515 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101102002112 its reverse (211200201101), we get a palindrome (312302203213).
The spelling of 101102002112 in words is "one hundred one billion, one hundred two million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •