Base | Representation |
---|---|
bin | 101111100101110011… |
… | …0110101000000010001 |
3 | 100202210111201010221021 |
4 | 1133023212311000101 |
5 | 3133301222414413 |
6 | 114541120555441 |
7 | 10245421243234 |
oct | 1371346650021 |
9 | 322714633837 |
10 | 102200201233 |
11 | 3a385392929 |
12 | 17982782b81 |
13 | 98395b1870 |
14 | 4d3735141b |
15 | 29d249618d |
hex | 17cb9b5011 |
102200201233 has 8 divisors (see below), whose sum is σ = 110105139200. Its totient is φ = 94301461008.
The previous prime is 102200201227. The next prime is 102200201267. The reversal of 102200201233 is 332102002201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102200201233 is a prime.
It is a super-2 number, since 2×1022002012332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102200201633) 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, 1515153 + ... + 1581166.
It is an arithmetic number, because the mean of its divisors is an integer number (13763142400).
Almost surely, 2102200201233 is an apocalyptic number.
102200201233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102200201233 is a deficient number, since it is larger than the sum of its proper divisors (7904937967).
102200201233 is a wasteful number, since it uses less digits than its factorization.
102200201233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3098871.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 102200201233 its reverse (332102002201), we get a palindrome (434302203434).
The spelling of 102200201233 in words is "one hundred two billion, two hundred million, two hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •