Base | Representation |
---|---|
bin | 1100000110000… |
… | …00100011101110 |
3 | 21001220022000000 |
4 | 12003000203232 |
5 | 201432431024 |
6 | 14022245130 |
7 | 2341220316 |
oct | 603004356 |
9 | 231808000 |
10 | 101452014 |
11 | 522a3444 |
12 | 29b867a6 |
13 | 180316a1 |
14 | d68c446 |
15 | 8d8ecc9 |
hex | 60c08ee |
101452014 has 56 divisors (see below), whose sum is σ = 230185800. Its totient is φ = 33518448.
The previous prime is 101451997. The next prime is 101452019. The reversal of 101452014 is 410254101.
It is a super-2 number, since 2×1014520142 = 20585022289312392, which contains 22 as substring.
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 (101452019) by changing a digit.
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 27 ways as a sum of consecutive naturals, for example, 217009 + ... + 217475.
Almost surely, 2101452014 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101452014, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115092900).
101452014 is an abundant number, since it is smaller than the sum of its proper divisors (128733786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101452014 is an equidigital number, since it uses as much as digits as its factorization.
101452014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 636 (or 621 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 101452014 is about 10072.3390530700. The cubic root of 101452014 is about 466.3946474804.
The spelling of 101452014 in words is "one hundred one million, four hundred fifty-two thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •