Base | Representation |
---|---|
bin | 1100001010111… |
… | …10110100000110 |
3 | 21010010020012000 |
4 | 12011132310012 |
5 | 202114201410 |
6 | 14044210130 |
7 | 2346560211 |
oct | 605366406 |
9 | 233106160 |
10 | 102100230 |
11 | 526a6461 |
12 | 2a239946 |
13 | 181ca74b |
14 | d7ba778 |
15 | 8e6bdc0 |
hex | 615ed06 |
102100230 has 32 divisors (see below), whose sum is σ = 272268000. Its totient is φ = 27226656.
The previous prime is 102100223. The next prime is 102100231. The reversal of 102100230 is 32001201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 188805 + ... + 189344.
It is an arithmetic number, because the mean of its divisors is an integer number (8508375).
Almost surely, 2102100230 is an apocalyptic number.
102100230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102100230 is an abundant number, since it is smaller than the sum of its proper divisors (170167770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100230 is a wasteful number, since it uses less digits than its factorization.
102100230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378165 (or 378159 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 102100230 is about 10104.4658443680. The cubic root of 102100230 is about 467.3858644037.
Adding to 102100230 its reverse (32001201), we get a palindrome (134101431).
The spelling of 102100230 in words is "one hundred two million, one hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •