Base | Representation |
---|---|
bin | 101111101001110001… |
… | …0010010110111011000 |
3 | 100210010210000201212002 |
4 | 1133103202102313120 |
5 | 3134034301334202 |
6 | 115002232140132 |
7 | 10251625051640 |
oct | 1372342226730 |
9 | 323123021762 |
10 | 102333230552 |
11 | 3a443493813 |
12 | 179bb237648 |
13 | 985b01b137 |
14 | 4d4ac9d520 |
15 | 29ddec2302 |
hex | 17d3892dd8 |
102333230552 has 64 divisors (see below), whose sum is σ = 227097216000. Its totient is φ = 42298091136.
The previous prime is 102333230537. The next prime is 102333230561. The reversal of 102333230552 is 255032333201.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1458173 + ... + 1526739.
It is an arithmetic number, because the mean of its divisors is an integer number (3548394000).
Almost surely, 2102333230552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102333230552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113548608000).
102333230552 is an abundant number, since it is smaller than the sum of its proper divisors (124763985448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102333230552 is a wasteful number, since it uses less digits than its factorization.
102333230552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69528 (or 69524 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 29.
Adding to 102333230552 its reverse (255032333201), we get a palindrome (357365563753).
The spelling of 102333230552 in words is "one hundred two billion, three hundred thirty-three million, two hundred thirty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •