Base | Representation |
---|---|
bin | 1100000110000… |
… | …00001010001101 |
3 | 21001220012202112 |
4 | 12003000022031 |
5 | 201432403011 |
6 | 14022233405 |
7 | 2341212464 |
oct | 603001215 |
9 | 231805675 |
10 | 101450381 |
11 | 522a219a |
12 | 29b85865 |
13 | 18030a16 |
14 | d68b9db |
15 | 8d8e58b |
hex | 60c028d |
101450381 has 8 divisors (see below), whose sum is σ = 106671000. Its totient is φ = 96344640.
The previous prime is 101450369. The next prime is 101450389. The reversal of 101450381 is 183054101.
It can be written as a sum of positive squares in 4 ways, for example, as 2149156 + 99301225 = 1466^2 + 9965^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101450381 - 218 = 101188237 is a prime.
It is a super-2 number, since 2×1014503812 = 20584359610090322, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101450389) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26906 + ... + 30443.
It is an arithmetic number, because the mean of its divisors is an integer number (13333875).
Almost surely, 2101450381 is an apocalyptic number.
It is an amenable number.
101450381 is a deficient number, since it is larger than the sum of its proper divisors (5220619).
101450381 is an equidigital number, since it uses as much as digits as its factorization.
101450381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57439.
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 101450381 is about 10072.2579891502. The cubic root of 101450381 is about 466.3921450607.
The spelling of 101450381 in words is "one hundred one million, four hundred fifty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •