Base | Representation |
---|---|
bin | 1011111100011… |
… | …10101100111111 |
3 | 20222112122111122 |
4 | 11332032230333 |
5 | 201122333411 |
6 | 13535341155 |
7 | 2324452016 |
oct | 576165477 |
9 | 228478448 |
10 | 100199231 |
11 | 51618190 |
12 | 296817bb |
13 | 179b33b2 |
14 | d443a7d |
15 | 8be39db |
hex | 5f8eb3f |
100199231 has 16 divisors (see below), whose sum is σ = 111138720. Its totient is φ = 89579520.
The previous prime is 100199213. The next prime is 100199233. The reversal of 100199231 is 132991001.
It is a cyclic number.
It is not a de Polignac number, because 100199231 - 210 = 100198207 is a prime.
It is a super-2 number, since 2×1001992312 = 20079771785982722, 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 100199231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100199233) 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 15 ways as a sum of consecutive naturals, for example, 231191 + ... + 231623.
It is an arithmetic number, because the mean of its divisors is an integer number (6946170).
Almost surely, 2100199231 is an apocalyptic number.
100199231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100199231 is a deficient number, since it is larger than the sum of its proper divisors (10939489).
100199231 is a wasteful number, since it uses less digits than its factorization.
100199231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746.
The product of its (nonzero) digits is 486, while the sum is 26.
The square root of 100199231 is about 10009.9565933125. The cubic root of 100199231 is about 464.4669283397.
The spelling of 100199231 in words is "one hundred million, one hundred ninety-nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •