Base | Representation |
---|---|
bin | 1100000101011… |
… | …01010011001100 |
3 | 21001202021210110 |
4 | 12002231103030 |
5 | 201422420012 |
6 | 14020440020 |
7 | 2340441330 |
oct | 602552314 |
9 | 231667713 |
10 | 101373132 |
11 | 5224a153 |
12 | 29b49010 |
13 | 18004803 |
14 | d66b7c0 |
15 | 8d7673c |
hex | 60ad4cc |
101373132 has 72 divisors (see below), whose sum is σ = 285390336. Its totient is φ = 27431136.
The previous prime is 101373109. The next prime is 101373137. The reversal of 101373132 is 231373101.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 101373099 and 101373108.
It is not an unprimeable number, because it can be changed into a prime (101373137) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 28653 + ... + 31995.
Almost surely, 2101373132 is an apocalyptic number.
101373132 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 101373132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142695168).
101373132 is an abundant number, since it is smaller than the sum of its proper divisors (184017204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101373132 is a wasteful number, since it uses less digits than its factorization.
101373132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3395 (or 3374 counting only the distinct ones).
The product of its (nonzero) digits is 378, while the sum is 21.
The square root of 101373132 is about 10068.4225179519. The cubic root of 101373132 is about 466.2737375040.
The spelling of 101373132 in words is "one hundred one million, three hundred seventy-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •