Base | Representation |
---|---|
bin | 1100001100011… |
… | …11111001110100 |
3 | 21010111110000001 |
4 | 12012033321310 |
5 | 202142120200 |
6 | 14052401044 |
7 | 2351355343 |
oct | 606177164 |
9 | 233443001 |
10 | 102301300 |
11 | 52823532 |
12 | 2a316184 |
13 | 1826b11a |
14 | d82db5a |
15 | 8eab76a |
hex | 618fe74 |
102301300 has 72 divisors (see below), whose sum is σ = 233658656. Its totient is φ = 38828160.
The previous prime is 102301267. The next prime is 102301307. The reversal of 102301300 is 3103201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102301307) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 158779 + ... + 159421.
Almost surely, 2102301300 is an apocalyptic number.
102301300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102301300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116829328).
102301300 is an abundant number, since it is smaller than the sum of its proper divisors (131357356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102301300 is a wasteful number, since it uses less digits than its factorization.
102301300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737 (or 730 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
The square root of 102301300 is about 10114.4105117402. The cubic root of 102301300 is about 467.6924770075.
Adding to 102301300 its reverse (3103201), we get a palindrome (105404501).
The spelling of 102301300 in words is "one hundred two million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •