Base | Representation |
---|---|
bin | 1011111110111… |
… | …01010111001101 |
3 | 21000011000110121 |
4 | 11333131113031 |
5 | 201213141141 |
6 | 13550304541 |
7 | 2330263240 |
oct | 577352715 |
9 | 230130417 |
10 | 100521421 |
11 | 51818260 |
12 | 297b8151 |
13 | 17a96c40 |
14 | d4c9257 |
15 | 8c591d1 |
hex | 5fdd5cd |
100521421 has 32 divisors (see below), whose sum is σ = 136136448. Its totient is φ = 71677440.
The previous prime is 100521413. The next prime is 100521439. The reversal of 100521421 is 124125001.
It is a cyclic number.
It is not a de Polignac number, because 100521421 - 23 = 100521413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100521395 and 100521404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100521451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 136771 + ... + 137503.
It is an arithmetic number, because the mean of its divisors is an integer number (4254264).
Almost surely, 2100521421 is an apocalyptic number.
100521421 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100521421 is a deficient number, since it is larger than the sum of its proper divisors (35615027).
100521421 is a wasteful number, since it uses less digits than its factorization.
100521421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 901.
The product of its (nonzero) digits is 80, while the sum is 16.
The square root of 100521421 is about 10026.0371533323. The cubic root of 100521421 is about 464.9642258677.
Adding to 100521421 its reverse (124125001), we get a palindrome (224646422).
The spelling of 100521421 in words is "one hundred million, five hundred twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •