Base | Representation |
---|---|
bin | 101111100010110110… |
… | …0011010001110011001 |
3 | 100202112121001020221202 |
4 | 1133011230122032121 |
5 | 3133100324013423 |
6 | 114523214443545 |
7 | 10243105122116 |
oct | 1370554321631 |
9 | 322477036852 |
10 | 102101001113 |
11 | 3a334398361 |
12 | 179555035b5 |
13 | 9821b8b177 |
14 | 4d280cb90d |
15 | 29c88ed728 |
hex | 17c5b1a399 |
102101001113 has 8 divisors (see below), whose sum is σ = 103710407808. Its totient is φ = 100494109584.
The previous prime is 102101001091. The next prime is 102101001127. The reversal of 102101001113 is 311100101201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102101001113 - 28 = 102101000857 is a prime.
It is a super-2 number, since 2×1021010011132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102101001094 and 102101001103.
It is not an unprimeable number, because it can be changed into a prime (102101006113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 546881 + ... + 709422.
It is an arithmetic number, because the mean of its divisors is an integer number (12963800976).
Almost surely, 2102101001113 is an apocalyptic number.
It is an amenable number.
102101001113 is a deficient number, since it is larger than the sum of its proper divisors (1609406695).
102101001113 is a wasteful number, since it uses less digits than its factorization.
102101001113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1257583.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 102101001113 its reverse (311100101201), we get a palindrome (413201102314).
The spelling of 102101001113 in words is "one hundred two billion, one hundred one million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •