Base | Representation |
---|---|
bin | 10110111111001110110000… |
… | …101101111011100111010011 |
3 | 111020222021110011002110001110 |
4 | 112333032300231323213103 |
5 | 101222424301200324334 |
6 | 555005413130104403 |
7 | 30203251523513541 |
oct | 2677166055734723 |
9 | 436867404073043 |
10 | 101102200011219 |
11 | 2a23a2251a5160 |
12 | b40a34a27b103 |
13 | 4454b869579b4 |
14 | 1ad753055ad91 |
15 | ba4d78490ae9 |
hex | 5bf3b0b7b9d3 |
101102200011219 has 8 divisors (see below), whose sum is σ = 147057745470912. Its totient is φ = 61274060612840.
The previous prime is 101102200011097. The next prime is 101102200011229. The reversal of 101102200011219 is 912110002201101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101102200011219 - 217 = 101102199880147 is a prime.
It is a super-2 number, since 2×1011022000112192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101102200011195 and 101102200011204.
It is not an unprimeable number, because it can be changed into a prime (101102200011229) 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, 1531851515289 + ... + 1531851515354.
It is an arithmetic number, because the mean of its divisors is an integer number (18382218183864).
Almost surely, 2101102200011219 is an apocalyptic number.
101102200011219 is a deficient number, since it is larger than the sum of its proper divisors (45955545459693).
101102200011219 is a wasteful number, since it uses less digits than its factorization.
101102200011219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3063703030657.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 101102200011219 in words is "one hundred one trillion, one hundred two billion, two hundred million, eleven thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •