Base | Representation |
---|---|
bin | 1100000010100… |
… | …10101111110110 |
3 | 21001001110000100 |
4 | 12001102233312 |
5 | 201324032410 |
6 | 14004454530 |
7 | 2334335100 |
oct | 601225766 |
9 | 231043010 |
10 | 101002230 |
11 | 5201651a |
12 | 299aa446 |
13 | 17c04a44 |
14 | d5b2570 |
15 | 8d018c0 |
hex | 6052bf6 |
101002230 has 144 divisors (see below), whose sum is σ = 314243280. Its totient is φ = 22425984.
The previous prime is 101002207. The next prime is 101002241. The reversal of 101002230 is 32200101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 162861 + ... + 163479.
It is an arithmetic number, because the mean of its divisors is an integer number (2182245).
Almost surely, 2101002230 is an apocalyptic number.
101002230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101002230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157121640).
101002230 is an abundant number, since it is smaller than the sum of its proper divisors (213241050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002230 is a wasteful number, since it uses less digits than its factorization.
101002230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 683 (or 673 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 101002230 is about 10049.9865671552. The cubic root of 101002230 is about 465.7043781912.
Adding to 101002230 its reverse (32200101), we get a palindrome (133202331).
The spelling of 101002230 in words is "one hundred one million, two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •