Base | Representation |
---|---|
bin | 101111100101110101… |
… | …0010101100101011001 |
3 | 100202210120102212202220 |
4 | 1133023222111211121 |
5 | 3133301441333423 |
6 | 114541152414253 |
7 | 10245432124140 |
oct | 1371352254531 |
9 | 322716385686 |
10 | 102201121113 |
11 | 3a385960a63 |
12 | 17982b47389 |
13 | 9839844480 |
14 | 4d37510757 |
15 | 29d25c89e3 |
hex | 17cba95959 |
102201121113 has 16 divisors (see below), whose sum is σ = 167714660736. Its totient is φ = 53908283520.
The previous prime is 102201121079. The next prime is 102201121123. The reversal of 102201121113 is 311121102201.
It is not a de Polignac number, because 102201121113 - 210 = 102201120089 is a prime.
It is a super-3 number, since 3×1022011211133 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102201121092 and 102201121101.
It is not an unprimeable number, because it can be changed into a prime (102201121123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 187181268 + ... + 187181813.
It is an arithmetic number, because the mean of its divisors is an integer number (10482166296).
Almost surely, 2102201121113 is an apocalyptic number.
102201121113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102201121113 is a deficient number, since it is larger than the sum of its proper divisors (65513539623).
102201121113 is a wasteful number, since it uses less digits than its factorization.
102201121113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374363104.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 102201121113 its reverse (311121102201), we get a palindrome (413322223314).
The spelling of 102201121113 in words is "one hundred two billion, two hundred one million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •