Base | Representation |
---|---|
bin | 101111011111111011… |
… | …1110011000100111001 |
3 | 100202021210020201001000 |
4 | 1132333313303010321 |
5 | 3132400322320233 |
6 | 114505405115213 |
7 | 10240510640622 |
oct | 1367767630471 |
9 | 322253221030 |
10 | 102003323193 |
11 | 3a294242502 |
12 | 17928858b09 |
13 | 980787b595 |
14 | 4d19142a49 |
15 | 29c0056d13 |
hex | 17bfdf3139 |
102003323193 has 32 divisors (see below), whose sum is σ = 153152657280. Its totient is φ = 67090507200.
The previous prime is 102003323179. The next prime is 102003323203. The reversal of 102003323193 is 391323300201.
102003323193 is a `hidden beast` number, since 10 + 2 + 0 + 0 + 332 + 319 + 3 = 666.
It is not a de Polignac number, because 102003323193 - 25 = 102003323161 is a prime.
It is a super-2 number, since 2×1020033231932 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (102003323113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 705655 + ... + 837827.
It is an arithmetic number, because the mean of its divisors is an integer number (4786020540).
Almost surely, 2102003323193 is an apocalyptic number.
It is an amenable number.
102003323193 is a deficient number, since it is larger than the sum of its proper divisors (51149334087).
102003323193 is a wasteful number, since it uses less digits than its factorization.
102003323193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132566 (or 132560 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
Adding to 102003323193 its reverse (391323300201), we get a palindrome (493326623394).
The spelling of 102003323193 in words is "one hundred two billion, three million, three hundred twenty-three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •