Base | Representation |
---|---|
bin | 101110100111010001… |
… | …1010010101010000111 |
3 | 100120101021210200110102 |
4 | 1131032203102222013 |
5 | 3120002120401434 |
6 | 113553011514315 |
7 | 10142423666426 |
oct | 1351643225207 |
9 | 316337720412 |
10 | 100102122119 |
11 | 394a9046a4a |
12 | 17497bb899b |
13 | 9593a1712c |
14 | 4bb88452bd |
15 | 290d1ad07e |
hex | 174e8d2a87 |
100102122119 has 4 divisors (see below), whose sum is σ = 100110406440. Its totient is φ = 100093837800.
The previous prime is 100102122047. The next prime is 100102122139. The reversal of 100102122119 is 911221201001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100102122119 - 236 = 31382645383 is a prime.
It is a super-2 number, since 2×1001021221192 (a number of 23 digits) contains 22 as substring.
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 100102122119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102122139) 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, 4124009 + ... + 4148210.
It is an arithmetic number, because the mean of its divisors is an integer number (25027601610).
Almost surely, 2100102122119 is an apocalyptic number.
100102122119 is a deficient number, since it is larger than the sum of its proper divisors (8284321).
100102122119 is an equidigital number, since it uses as much as digits as its factorization.
100102122119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8284320.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 100102122119 in words is "one hundred billion, one hundred two million, one hundred twenty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •