Base | Representation |
---|---|
bin | 101110100111110111… |
… | …1100011010011010001 |
3 | 100120102200102100010001 |
4 | 1131033233203103101 |
5 | 3120022230110413 |
6 | 113555004210001 |
7 | 10143055630522 |
oct | 1351757432321 |
9 | 316380370101 |
10 | 100122113233 |
11 | 3950936062a |
12 | 174a2839901 |
13 | 9597bc64ac |
14 | 4bbb36a849 |
15 | 290ed0b4dd |
hex | 174fbe34d1 |
100122113233 has 8 divisors (see below), whose sum is σ = 106964709920. Its totient is φ = 93436817760.
The previous prime is 100122113219. The next prime is 100122113249. The reversal of 100122113233 is 332311221001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100122113233 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100122113233.
It is not an unprimeable number, because it can be changed into a prime (100122113213) 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, 39323988 + ... + 39326533.
It is an arithmetic number, because the mean of its divisors is an integer number (13370588740).
Almost surely, 2100122113233 is an apocalyptic number.
It is an amenable number.
100122113233 is a deficient number, since it is larger than the sum of its proper divisors (6842596687).
100122113233 is an equidigital number, since it uses as much as digits as its factorization.
100122113233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78650607.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 100122113233 its reverse (332311221001), we get a palindrome (432433334234).
The spelling of 100122113233 in words is "one hundred billion, one hundred twenty-two million, one hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •