Base | Representation |
---|---|
bin | 1100000101110… |
… | …10000110100100 |
3 | 21001211221201200 |
4 | 12002322012210 |
5 | 201431104242 |
6 | 14021522500 |
7 | 2341050243 |
oct | 602720644 |
9 | 231757650 |
10 | 101425572 |
11 | 52285596 |
12 | 29b73430 |
13 | 18022641 |
14 | d68295a |
15 | 8d8704c |
hex | 60ba1a4 |
101425572 has 72 divisors (see below), whose sum is σ = 273436800. Its totient is φ = 31606848.
The previous prime is 101425567. The next prime is 101425601. The reversal of 101425572 is 275524101.
101425572 is a `hidden beast` number, since 101 + 4 + 2 + 557 + 2 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53098 + ... + 54974.
Almost surely, 2101425572 is an apocalyptic number.
101425572 is a gapful number since it is divisible by the number (12) 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 101425572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136718400).
101425572 is an abundant number, since it is smaller than the sum of its proper divisors (172011228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101425572 is a wasteful number, since it uses less digits than its factorization.
101425572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1985 (or 1980 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 101425572 is about 10071.0263627894. The cubic root of 101425572 is about 466.3541242867.
Adding to 101425572 its reverse (275524101), we get a palindrome (376949673).
The spelling of 101425572 in words is "one hundred one million, four hundred twenty-five thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •