Base | Representation |
---|---|
bin | 1011111110001… |
… | …00111011010011 |
3 | 20222221221011120 |
4 | 11333010323103 |
5 | 201201440311 |
6 | 13544213323 |
7 | 2326365363 |
oct | 577047323 |
9 | 228857146 |
10 | 100421331 |
11 | 5175a03a |
12 | 2976a243 |
13 | 17a6050a |
14 | d4a09a3 |
15 | 8c39706 |
hex | 5fc4ed3 |
100421331 has 4 divisors (see below), whose sum is σ = 133895112. Its totient is φ = 66947552.
The previous prime is 100421323. The next prime is 100421333. The reversal of 100421331 is 133124001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100421331 - 23 = 100421323 is a prime.
It is a super-2 number, since 2×1004213312 = 20168887439623122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100421331.
It is not an unprimeable number, because it can be changed into a prime (100421333) 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 3 ways as a sum of consecutive naturals, for example, 16736886 + ... + 16736891.
It is an arithmetic number, because the mean of its divisors is an integer number (33473778).
Almost surely, 2100421331 is an apocalyptic number.
100421331 is a deficient number, since it is larger than the sum of its proper divisors (33473781).
100421331 is an equidigital number, since it uses as much as digits as its factorization.
100421331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33473780.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 100421331 is about 10021.0444066474. The cubic root of 100421331 is about 464.8098517266.
Adding to 100421331 its reverse (133124001), we get a palindrome (233545332).
The spelling of 100421331 in words is "one hundred million, four hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •