Base | Representation |
---|---|
bin | 1100000101110… |
… | …01110111110111 |
3 | 21001211220102211 |
4 | 12002321313313 |
5 | 201431042011 |
6 | 14021514251 |
7 | 2341044430 |
oct | 602716767 |
9 | 231756384 |
10 | 101424631 |
11 | 52284910 |
12 | 29b72987 |
13 | 18022099 |
14 | d682487 |
15 | 8d86b21 |
hex | 60b9df7 |
101424631 has 16 divisors (see below), whose sum is σ = 127243008. Its totient is φ = 78537600.
The previous prime is 101424623. The next prime is 101424671. The reversal of 101424631 is 136424101.
It is a cyclic number.
It is not a de Polignac number, because 101424631 - 23 = 101424623 is a prime.
It is a super-2 number, since 2×1014246312 = 20573911546972322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101424671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8511 + ... + 16591.
It is an arithmetic number, because the mean of its divisors is an integer number (7952688).
Almost surely, 2101424631 is an apocalyptic number.
101424631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101424631 is a deficient number, since it is larger than the sum of its proper divisors (25818377).
101424631 is a wasteful number, since it uses less digits than its factorization.
101424631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8262.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 101424631 is about 10070.9796445033. The cubic root of 101424631 is about 466.3526820449.
Adding to 101424631 its reverse (136424101), we get a palindrome (237848732).
The spelling of 101424631 in words is "one hundred one million, four hundred twenty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •