Base | Representation |
---|---|
bin | 101110100111100110… |
… | …1001011100101110111 |
3 | 100120102001110120200222 |
4 | 1131033031023211313 |
5 | 3120012423300343 |
6 | 113554043124555 |
7 | 10142616223340 |
oct | 1351715134567 |
9 | 316361416628 |
10 | 100113103223 |
11 | 39504267241 |
12 | 1749b81375b |
13 | 9596090423 |
14 | 4bba0a30c7 |
15 | 290e12ba68 |
hex | 174f34b977 |
100113103223 has 4 divisors (see below), whose sum is σ = 114414975120. Its totient is φ = 85811231328.
The previous prime is 100113103201. The next prime is 100113103231. The reversal of 100113103223 is 322301311001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322301311001 = 1427 ⋅225859363.
It is a cyclic number.
It is not a de Polignac number, because 100113103223 - 218 = 100112841079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100113103273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7150935938 + ... + 7150935951.
It is an arithmetic number, because the mean of its divisors is an integer number (28603743780).
Almost surely, 2100113103223 is an apocalyptic number.
100113103223 is a deficient number, since it is larger than the sum of its proper divisors (14301871897).
100113103223 is an equidigital number, since it uses as much as digits as its factorization.
100113103223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14301871896.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 100113103223 its reverse (322301311001), we get a palindrome (422414414224).
The spelling of 100113103223 in words is "one hundred billion, one hundred thirteen million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •