Base | Representation |
---|---|
bin | 11110000011011… |
… | …00001010110100 |
3 | 122120101001222012 |
4 | 33001230022310 |
5 | 1004014220200 |
6 | 41003223352 |
7 | 6150553133 |
oct | 1701541264 |
9 | 576331865 |
10 | 252101300 |
11 | 11a339490 |
12 | 70517b58 |
13 | 402c9c89 |
14 | 256a591a |
15 | 171eba35 |
hex | f06c2b4 |
252101300 has 72 divisors (see below), whose sum is σ = 616127232. Its totient is φ = 88704000.
The previous prime is 252101293. The next prime is 252101327. The reversal of 252101300 is 3101252.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 30404 + ... + 37796.
Almost surely, 2252101300 is an apocalyptic number.
252101300 is a gapful number since it is divisible by the number (20) 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 252101300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (308063616).
252101300 is an abundant number, since it is smaller than the sum of its proper divisors (364025932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252101300 is a wasteful number, since it uses less digits than its factorization.
252101300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7449 (or 7442 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 252101300 is about 15877.6981958973. The cubic root of 252101300 is about 631.7205843040.
Adding to 252101300 its reverse (3101252), we get a palindrome (255202552).
The spelling of 252101300 in words is "two hundred fifty-two million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.264 sec. • engine limits •