Base | Representation |
---|---|
bin | 1100000010101… |
… | …01111011010100 |
3 | 21001002002212122 |
4 | 12001111323110 |
5 | 201324442002 |
6 | 14005035112 |
7 | 2334421052 |
oct | 601257324 |
9 | 231062778 |
10 | 101015252 |
11 | 52025288 |
12 | 299b5a98 |
13 | 17c0a950 |
14 | d5b71d2 |
15 | 8d056a2 |
hex | 6055ed4 |
101015252 has 24 divisors (see below), whose sum is σ = 191089416. Its totient is φ = 46447488.
The previous prime is 101015231. The next prime is 101015261. The reversal of 101015252 is 252510101.
It can be written as a sum of positive squares in 4 ways, for example, as 4268356 + 96746896 = 2066^2 + 9836^2 .
It is a super-3 number, since 3×1010152523 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 101015252.
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 7 ways as a sum of consecutive naturals, for example, 10898 + ... + 17910.
It is an arithmetic number, because the mean of its divisors is an integer number (7962059).
Almost surely, 2101015252 is an apocalyptic number.
It is an amenable number.
101015252 is a deficient number, since it is larger than the sum of its proper divisors (90074164).
101015252 is a wasteful number, since it uses less digits than its factorization.
101015252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7307 (or 7305 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 101015252 is about 10050.6344078371. The cubic root of 101015252 is about 465.7243914187.
Adding to 101015252 its reverse (252510101), we get a palindrome (353525353).
The spelling of 101015252 in words is "one hundred one million, fifteen thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •