Base | Representation |
---|---|
bin | 101110101010001100… |
… | …1000101110001111111 |
3 | 100120122010012001020210 |
4 | 1131110121011301333 |
5 | 3120202212024411 |
6 | 114010432043503 |
7 | 10145023615113 |
oct | 1352431056177 |
9 | 316563161223 |
10 | 100200111231 |
11 | 39549394690 |
12 | 17504993593 |
13 | 95ab10555c |
14 | 4bc7871743 |
15 | 2916ab6ca6 |
hex | 1754645c7f |
100200111231 has 8 divisors (see below), whose sum is σ = 145745616384. Its totient is φ = 60727340120.
The previous prime is 100200111227. The next prime is 100200111251. The reversal of 100200111231 is 132111002001.
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 100200111231 - 22 = 100200111227 is a prime.
It is a super-2 number, since 2×1002001112312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100200111251) 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, 1518183471 + ... + 1518183536.
It is an arithmetic number, because the mean of its divisors is an integer number (18218202048).
Almost surely, 2100200111231 is an apocalyptic number.
100200111231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100200111231 is a deficient number, since it is larger than the sum of its proper divisors (45545505153).
100200111231 is a wasteful number, since it uses less digits than its factorization.
100200111231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3036367021.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 100200111231 its reverse (132111002001), we get a palindrome (232311113232).
The spelling of 100200111231 in words is "one hundred billion, two hundred million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •