Base | Representation |
---|---|
bin | 101111000010001100… |
… | …0010000101101111100 |
3 | 100122201020002210202200 |
4 | 1132010120100231330 |
5 | 3123324312402002 |
6 | 114222351551500 |
7 | 10204001015325 |
oct | 1360430205574 |
9 | 318636083680 |
10 | 101005200252 |
11 | 39921890a10 |
12 | 176aa52b590 |
13 | 96a8b4a8a8 |
14 | 4c6276344c |
15 | 29625e6b1c |
hex | 1784610b7c |
101005200252 has 36 divisors (see below), whose sum is σ = 278529492696. Its totient is φ = 30607636320.
The previous prime is 101005200223. The next prime is 101005200259. The reversal of 101005200252 is 252002500101.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101005200259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 127531423 + ... + 127532214.
Almost surely, 2101005200252 is an apocalyptic number.
101005200252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101005200252 is an abundant number, since it is smaller than the sum of its proper divisors (177524292444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101005200252 is a wasteful number, since it uses less digits than its factorization.
101005200252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255063658 (or 255063653 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
Adding to 101005200252 its reverse (252002500101), we get a palindrome (353007700353).
The spelling of 101005200252 in words is "one hundred one billion, five million, two hundred thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •