Base | Representation |
---|---|
bin | 1100000100111… |
… | …00001111010010 |
3 | 21001121201221020 |
4 | 12002130033102 |
5 | 201413201000 |
6 | 14015140310 |
7 | 2340030516 |
oct | 602341722 |
9 | 231551836 |
10 | 101303250 |
11 | 522016a4 |
12 | 29b14696 |
13 | 17caba69 |
14 | d650146 |
15 | 8d60ba0 |
hex | 609c3d2 |
101303250 has 64 divisors (see below), whose sum is σ = 266198400. Its totient is φ = 25588800.
The previous prime is 101303203. The next prime is 101303273. The reversal of 101303250 is 52303101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10696 + ... + 17804.
It is an arithmetic number, because the mean of its divisors is an integer number (4159350).
Almost surely, 2101303250 is an apocalyptic number.
101303250 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 101303250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133099200).
101303250 is an abundant number, since it is smaller than the sum of its proper divisors (164895150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101303250 is a wasteful number, since it uses less digits than its factorization.
101303250 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7148 (or 7138 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 101303250 is about 10064.9515647121. The cubic root of 101303250 is about 466.1665702797.
Adding to 101303250 its reverse (52303101), we get a palindrome (153606351).
The spelling of 101303250 in words is "one hundred one million, three hundred three thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •