Base | Representation |
---|---|
bin | 101110100111110110… |
… | …0100010011011010011 |
3 | 100120102121221012102021 |
4 | 1131033230202123103 |
5 | 3120022024320334 |
6 | 113554535232311 |
7 | 10143046130341 |
oct | 1351754423323 |
9 | 316377835367 |
10 | 100121323219 |
11 | 39508971025 |
12 | 174a2518697 |
13 | 95979aaa28 |
14 | 4bbb202991 |
15 | 290ec023b4 |
hex | 174fb226d3 |
100121323219 has 4 divisors (see below), whose sum is σ = 100190231296. Its totient is φ = 100052415144.
The previous prime is 100121323147. The next prime is 100121323223. The reversal of 100121323219 is 912323121001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 912323121001 = 157 ⋅5810975293.
It is a cyclic number.
It is not a de Polignac number, because 100121323219 - 219 = 100120798931 is a prime.
It is a super-2 number, since 2×1001213232192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100121323193 and 100121323202.
It is not an unprimeable number, because it can be changed into a prime (100121323229) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34451859 + ... + 34454764.
It is an arithmetic number, because the mean of its divisors is an integer number (25047557824).
Almost surely, 2100121323219 is an apocalyptic number.
100121323219 is a deficient number, since it is larger than the sum of its proper divisors (68908077).
100121323219 is an equidigital number, since it uses as much as digits as its factorization.
100121323219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68908076.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 100121323219 in words is "one hundred billion, one hundred twenty-one million, three hundred twenty-three thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •