Base | Representation |
---|---|
bin | 101111100101110100… |
… | …1111010101100111001 |
3 | 100202210120020021201200 |
4 | 1133023221322230321 |
5 | 3133301424323001 |
6 | 114541150204413 |
7 | 10245431155125 |
oct | 1371351725471 |
9 | 322716207650 |
10 | 102201011001 |
11 | 3a385896261 |
12 | 17982ab3709 |
13 | 983980630b |
14 | 4d374c2585 |
15 | 29d25a6086 |
hex | 17cba7ab39 |
102201011001 has 12 divisors (see below), whose sum is σ = 155393350320. Its totient is φ = 64548006840.
The previous prime is 102201010979. The next prime is 102201011041. The reversal of 102201011001 is 100110102201.
It is a happy number.
It is not a de Polignac number, because 102201011001 - 29 = 102201010489 is a prime.
It is a super-3 number, since 3×1022010110013 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (102201011041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 298833195 + ... + 298833536.
It is an arithmetic number, because the mean of its divisors is an integer number (12949445860).
Almost surely, 2102201011001 is an apocalyptic number.
It is an amenable number.
102201011001 is a deficient number, since it is larger than the sum of its proper divisors (53192339319).
102201011001 is a wasteful number, since it uses less digits than its factorization.
102201011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 597666756 (or 597666753 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102201011001 its reverse (100110102201), we get a palindrome (202311113202).
The spelling of 102201011001 in words is "one hundred two billion, two hundred one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •