Base | Representation |
---|---|
bin | 101110100100111000… |
… | …1101101000010010111 |
3 | 100120011201001202220212 |
4 | 1131021301231002113 |
5 | 3114321113422403 |
6 | 113541030520035 |
7 | 10140432043364 |
oct | 1351161550227 |
9 | 316151052825 |
10 | 100022014103 |
11 | 39467901680 |
12 | 1747520601b |
13 | 958024983b |
14 | 4babd5146b |
15 | 29061374d8 |
hex | 1749c6d097 |
100022014103 has 4 divisors (see below), whose sum is σ = 109114924488. Its totient is φ = 90929103720.
The previous prime is 100022014097. The next prime is 100022014109. The reversal of 100022014103 is 301410220001.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (100022014097) and next prime (100022014109).
It is a cyclic number.
It is not a de Polignac number, because 100022014103 - 24 = 100022014087 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 (100022014109) 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 3 ways as a sum of consecutive naturals, for example, 4546455176 + ... + 4546455197.
It is an arithmetic number, because the mean of its divisors is an integer number (27278731122).
Almost surely, 2100022014103 is an apocalyptic number.
100022014103 is a deficient number, since it is larger than the sum of its proper divisors (9092910385).
100022014103 is an equidigital number, since it uses as much as digits as its factorization.
100022014103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9092910384.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 100022014103 its reverse (301410220001), we get a palindrome (401432234104).
The spelling of 100022014103 in words is "one hundred billion, twenty-two million, fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •